An application of extended cuckoo search to vehicle routing problem

Cuckoo Search is one of the latest bio-inspired meta-heuristic algorithms. It is based on the reproduction behaviour of some cuckoo species and combined with the Levy flights. Cuckoo Search was first developed for solving continuous problem and successfully improved and extended for the travelling salesman problem. We adapted this extension of Cuckoo Search for the capacitated vehicle routing problem. The results show that the adaptation is potential to solve the capacitated vehicle routing problem in acceptable time.

[1]  Zulaiha Ali Othman,et al.  Cuckoo search algorithm for capacitated vehicle routing problem , 2016 .

[2]  Ali R. Yildiz,et al.  Cuckoo search algorithm for the selection of optimal machining parameters in milling operations , 2012, The International Journal of Advanced Manufacturing Technology.

[3]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[4]  Michel Gendreau,et al.  Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography , 2008 .

[5]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[6]  Francisco B. Pereira,et al.  Bio-inspired Algorithms for the Vehicle Routing Problem , 2008, Bio-inspired Algorithms for the Vehicle Routing Problem.

[7]  Enrique Alba,et al.  Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm , 2006, Inf. Process. Lett..

[8]  Xin-She Yang,et al.  Discrete cuckoo search algorithm for the travelling salesman problem , 2014, Neural Computing and Applications.

[9]  İsmail Durgun,et al.  Structural Design Optimization of Vehicle Components Using Cuckoo Search Algorithm , 2012 .

[10]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[11]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[12]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[13]  Mirko Vujosevic,et al.  Enhanced savings calculation and its applications for solving capacitated vehicle routing problem , 2013, Appl. Math. Comput..

[14]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[15]  Tantikorn Pichpibul,et al.  An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem , 2012 .

[16]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[17]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

[18]  Temel Öncan,et al.  A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem , 2005, J. Oper. Res. Soc..

[19]  Saeed Tavakoli,et al.  Improved Cuckoo Search Algorithm for Feed forward Neural Network Training , 2011 .

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

[21]  Enrique Alba,et al.  Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms , 2004, EvoCOP.

[22]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[23]  T. Amudha,et al.  A Study on Bio-Inspired Metaheuristics for Solving Vehicle Routing Problem , 2015 .