Tour splitting algorithms for vehicle routing problems - Archive ouverte HAL Access content directly
Journal Articles International Journal of Production Research Year : 2008

Tour splitting algorithms for vehicle routing problems

(1) , (1) , (1)
1

Abstract

Tour splitting heuristics for capacitated vehicle routing problems build one giant tour visiting all customers and split this tour into capacity-feasible vehicle trips. They are seldom used alone because of a reputation of limited performance. This paper describes how to improve them to obtain better solutions or tackle additional constraints. Numerical tests on the capacitated arc routing problem (CARP) and the capacitated vehicle routing problem (CVRP) show that randomized versions outperform classical constructive heuristics. A greedy randomized adaptive search procedure (GRASP) and an iterated local search (ILS) based on these principles even compete with published metaheuristics, while being faster and simpler.
Not file

Dates and versions

hal-02525151 , version 1 (30-03-2020)

Identifiers

Cite

Christian Prins, Nacima Labadie, Mohamed Reghioui. Tour splitting algorithms for vehicle routing problems. International Journal of Production Research, 2008, 47 (2), pp.507-535. ⟨10.1080/00207540802426599⟩. ⟨hal-02525151⟩

Collections

CNRS UTT LOSI
222 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More