Combining Neighborhood Search with Path Relinking: A Statistical Evaluation of Path Relinking Mechanisms
摘要
A metaheuristic algorithm for solving Capacitated Vehicle Routing Problem (CVRP) that is composed of neighborhood search and path relinking is proposed. Path relinking is a method to integrate intensification and diversification into the neighborhood search. We test several mechanisms of integration between neighborhood search and path relinking. Several variants of the mechanism give a significant improvement to the baseline algorithm. Furthermore, the best hybridization mechanism is found by performing a post-hoc analysis.