A Hybrid Bat Algorithm with Path Relinking for the Capacitated Vehicle Routing Problem

The capacitated vehicle routing problem (CVRP) is an NP-hard problem with both engineering and theoretical interests. In this paper, a hybrid bat algorithm with path relinking (HBA-PR) is proposed to solve CVRP. The HBA-PR is constructed based on the framework of the continuous bat algorithm, the greedy randomized adaptive search procedure (GRASP) and path relinking are effectively integrated into the bat algorithm. Moreover, in order to further improve the performance, the random subsequences and single-point local search are operated with certain loudness (a probability). In order to verify the effectiveness of our approach and its efficiency and compare with other existing methodologies, several classical CVRP instances from three classes of CVRP benchmarks are selected to test. Experimental results and comparisons show the HBA-PR is effective for solving CVRPs.

[1]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[2]  Leen Stougie,et al.  ANALYSIS OF HEURISTICS FOR VEHICLE ROUTING PROBLEMS , 1988 .

[3]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[4]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[5]  Celso C. Ribeiro,et al.  GRASP with Path-Relinking: Recent Advances and Applications , 2005 .

[6]  Voratas Kachitvichyanukul,et al.  A particle swarm optimization for the capacitated vehicle routing problem , 2007 .

[7]  Paolo Toth,et al.  An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems , 2008 .

[8]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part I: Algorithms , 2022 .

[9]  Voratas Kachitvichyanukul,et al.  Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem , 2009, Comput. Ind. Eng..

[10]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part Ii: Applications , 2022 .

[11]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[12]  Germán Terrazas,et al.  Nature Inspired Cooperative Strategies for Optimization, NICSO 2010, May 12-14, 2010, Granada, Spain , 2012, NISCO.

[13]  Celso C. Ribeiro,et al.  Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications , 2010 .

[14]  Angel A. Juan,et al.  The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem , 2008 .

[15]  Ping Chen,et al.  Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem , 2010, Expert Syst. Appl..

[16]  Alkin Yurtkuran,et al.  A new Hybrid Electromagnetism-like Algorithm for capacitated vehicle routing problems , 2010, Expert Syst. Appl..

[17]  Xin-She Yang,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[18]  W. Y. Szeto,et al.  An artificial bee colony algorithm for the capacitated vehicle routing problem , 2011, Eur. J. Oper. Res..

[19]  Lai Soon Lee,et al.  Optimised crossover genetic algorithm for capacitated vehicle routing problem , 2012 .

[20]  Gaige Wang,et al.  A Bat Algorithm with Mutation for UCAV Path Planning , 2012, TheScientificWorldJournal.

[21]  Debahuti Mishra,et al.  A New Meta-heuristic Bat Inspired Classification Approach for Microarray Data , 2012 .

[22]  Xin-She Yang,et al.  Bat algorithm: a novel approach for global engineering optimization , 2012, 1211.6663.

[23]  Amir Hossein Gandomi,et al.  Bat algorithm for constrained optimization tasks , 2012, Neural Computing and Applications.

[24]  Yongquan Zhou,et al.  A hybrid Cuckoo Search Algorithm-GRASP for Vehicle Routing Problem , 2013 .

[25]  Jian Xie,et al.  A Novel Bat Algorithm Based on Differential Operator and Lévy Flights Trajectory , 2013, Comput. Intell. Neurosci..

[26]  Luiz Satoru Ochi,et al.  GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem , 2013, Comput. Oper. Res..