Publication
Title
Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
Author
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.
Language
Dutch, English
Source (journal)
Computers & operations research. - New York, N.Y.
Publication
New York, N.Y. : 2013
ISSN
0305-0548
Volume/pages
40:12(2013), p. 3197-3205
ISI
000326610000036
Full text (Publisher's DOI)
Full text (publisher's version - intranet only)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 12.04.2013
Last edited 19.06.2017
To cite this reference