A Hybrid Method Based on Intelligent Water Drop Algorithm and Simulated Annealing for Solving Multi-depot Vehicle Routing Problem

The vehicle routing problem and its variants such as the multi-depot vehicle routing problem are well-known NP-hard combinatorial optimization problems with wide engineering and theoretical background. In this paper a new hybrid technique based on intelligent water drop algorithm and simulated annealing is proposed to solve the multi-depot vehicle routing problem. The intelligent water drop algorithm is a stochastic population based metaheuristic optimization algorithm that uses a constructive approach to find optimal solutions of a given problem. Simulated annealing is a popular local search meta-heuristic approach with the key features of being able to provide a means to escape local optima by allowing hill-climbing moves with the hope of finding a global optimum. The performance of the hybrid algorithm is evaluated on a set of 23 benchmark instances and the results obtained compared with the best known solutions. The computational results show that the proposed method can produce good solutions, indicating that it is a good alternative algorithm for solving the multi-depot vehicle routing problem.

[1]  Vahid Kayvanfar,et al.  Enhanced intelligent water drops and cuckoo search algorithms for solving the capacitated vehicle routing problem , 2016, Inf. Sci..

[2]  Khairuddin Omar,et al.  Vehicle routing problem: models and solutions , 2008 .

[3]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[4]  Voratas Kachitvichyanukul,et al.  Two solution representations for solving multi-depot vehicle routing problem with multiple pickup and delivery requests via PSO , 2015, Comput. Ind. Eng..

[5]  Angel A. Juan,et al.  Rich Vehicle Routing Problem , 2014, ACM Comput. Surv..

[6]  Praveen Ranjan Srivastava,et al.  Code coverage using intelligent water drop (IWD) , 2012, Int. J. Bio Inspired Comput..

[7]  H. Shah-Hosseini.  An approach to continuous optimization by the Intelligent Water Drops algorithm , 2012 .

[8]  Farzaneh Daneshzand,et al.  The Vehicle-Routing Problem , 2011 .

[9]  Sanjay Mohapatra,et al.  Survey of Methodologies for TSP and VRP , 2014 .

[10]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[11]  Henry C. W. Lau,et al.  A hybrid genetic algorithm for the multi-depot vehicle routing problem , 2008, Eng. Appl. Artif. Intell..

[12]  Ching-Jung Ting,et al.  A simulated annealing heuristic for the capacitated location routing problem , 2010, Comput. Ind. Eng..

[13]  Bülent Çatay,et al.  A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery , 2010, Expert Syst. Appl..

[14]  Hamed Shah-Hosseini,et al.  Problem solving by intelligent water drops , 2007, 2007 IEEE Congress on Evolutionary Computation.

[15]  Chinyao Low,et al.  Heuristic solutions to multi-depot location-routing problems , 2002, Comput. Oper. Res..

[16]  Maria Grazia Speranza,et al.  The Split Delivery Vehicle Routing Problem: A Survey , 2008 .

[17]  Hamed Shah-Hosseini,et al.  The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm , 2009, Int. J. Bio Inspired Comput..

[18]  I D Giosa,et al.  New assignment algorithms for the multi-depot vehicle routing problem , 2002, J. Oper. Res. Soc..

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

[20]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

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

[22]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .