Where to Split in Hybrid Genetic Search for the Capacitated Vehicle Routing Problem

Where to Split in Hybrid Genetic Search for the Capacitated Vehicle Routing Problem

One of the best heuristic algorithms for solving the capacitated vehicle routing problem is a hybrid genetic search. A critical component of the search is a splitting procedure, where a solution encoded as a giant tour of nodes is optimally split into vehicle routes using dynamic programming. Howeve...

Full description

Saved in:
Bibliographic Details
Main Author: Lars Magnus Hvattum
Format: Article
Language:English
Published: MDPI AG 2025-03-01
Series:Algorithms
Subjects:
vehicle routing problem
genetic algorithm
open source
genetic operator
Online Access:https://www.mdpi.com/1999-4893/18/3/165
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/1999-4893/18/3/165

Similar Items