Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem

Authors:
Kenneth Sörensen;Patrick Schittekat
Affiliations:
University of Antwerp, Faculty of Applied Economics, ANT/OR University of Antwerp Operations Research Group, Prinsstraat 13, 2000 Antwerp, Belgium;University of Antwerp, Faculty of Applied Economics, ANT/OR University of Antwerp Operations Research Group, Prinsstraat 13, 2000 Antwerp, Belgium
Venue:
Computers and Operations Research
Year:
2013

Citing 10
Cited 0

Variable neighborhood search

Computers and Operations Research
The String-to-String Correction Problem

Journal of the ACM (JACM)
Scatter search and path relinking

New ideas in optimization
A path relinking algorithm for the generalized assignment problem

Metaheuristics
Active-guided evolution strategies for large-scale capacitated vehicle routing problems

Computers and Operations Research
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem

Computers and Operations Research
GRASP with Path Relinking for the Capacitated Arc Routing Problem with Time Windows

Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem

Networks - Route 2007
A Path Relinking approach for the Team Orienteering Problem

Computers and Operations Research
A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we develop an intelligent path relinking procedure for the capacitated vehicle routing problem, based on the relocate distance. This procedure transforms an incumbent solution into a guiding solution in a minimal number of relocate moves. In each step of the path relinking procedure, one customer is removed from the solution and re-inserted in another position. The path relinking procedure is integrated in a grasp (greedy randomized adaptive search procedure) and vnd (variable neighborhood descent) framework and thoroughly tested. This analysis shows that the path relinking procedure is not able to improve the performance of a simple grasp+vnd metaheuristic, but some interesting conclusions can nonetheless be drawn. A second contribution of this paper is an analysis of the computational results based on sound statistical techniques. Such an analysis can be useful for the field of metaheuristics, where computational results are generally analyzed in an ad hoc way and often with dubious statistical validity.