Where to Split in Hybrid Genetic Search for the Capacitated Vehicle Routing Problem
Algorithms · 13.03.2025 · 18 (3) · 165
DOI: 10.3390/a18030165 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algorithms, online erschienen am 13.03.2025. Verfasst von Lars Magnus Hvattum. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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. However, the current state-of-the-art implementation of the splitting procedure assumes that the start of the giant tour is fixed as a part of the encoded solution. This paper examines whether the fixed starting point is a significant drawback. Results indicate that simple adjustments of the starting point for the splitting procedure can improve the performance of the genetic search, as measured by the average primal gaps of the final solutions obtained, by 3.9%.
Zitieren
APA
Hvattum, L. M. (2025). Where to Split in Hybrid Genetic Search for the Capacitated Vehicle Routing Problem. Algorithms, 18(3), 165. https://doi.org/10.3390/a18030165
Vancouver
Hvattum LM. Where to Split in Hybrid Genetic Search for the Capacitated Vehicle Routing Problem. Algorithms. 2025;18(3):165. doi:10.3390/a18030165
BibTeX
@article{Hvattum2025,
author = {Hvattum, Lars Magnus},
title = {Where to Split in Hybrid Genetic Search for the Capacitated Vehicle Routing Problem},
journal = {Algorithms},
year = {2025},
volume = {18},
number = {3},
pages = {165},
doi = {10.3390/a18030165}
}
EUVIMED