An improved optimization method based on the intelligent water drops algorithm for the vehicle routing problem

We introduce an improved intelligent water drops (IIWD) algorithm as a new swarm-based nature inspired algorithm to solve capacitated vehicle routing problem. IIWD algorithm introduces new adjustments and features that help to optimize the VRP problem with higher efficiency. We reinforce this algorithm to have satisfactory consequences in controlling the balance between diversification and intensification of the search process. We solve 14 well-known benchmark instances in the literature to compare the solutions with the best reported solutions in the literature. Experimental results demonstrate that the suggested technique can well and effectively cope with such problems.

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

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

[3]  Andrew Y. C. Nee,et al.  An improved Intelligent Water Drops algorithm for achieving optimal job-shop scheduling solutions , 2012 .

[4]  Christian Prins,et al.  Two memetic algorithms for heterogeneous fleet vehicle routing problems , 2009, Eng. Appl. Artif. Intell..

[5]  Reza Tavakkoli-Moghaddam,et al.  A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing , 2011 .

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

[7]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

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

[9]  Philippe Castagliola,et al.  A Memetic Algorithm for a Pick-Up and Delivery Problem by Helicopter , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.

[10]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[11]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[12]  Petrica C. Pop,et al.  An improved hybrid algorithm for solving the generalized vehicle routing problem , 2013, Neurocomputing.

[13]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

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

[15]  Xiangpei Hu,et al.  An improved ant colony optimization and its application to vehicle routing problem with time windows , 2012, Neurocomputing.

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

[17]  Vahid Kayvanfar,et al.  Hybrid intelligent water drops algorithm to unrelated parallel machines scheduling problem: a just-in-time approach , 2014 .

[18]  Alex Van Breedam,et al.  Improvement heuristics for the Vehicle Routing Problem based on simulated annealing , 1995 .

[19]  Richard F. Hartl,et al.  D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..

[20]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

[21]  Lúcia Maria de A. Drummond,et al.  Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem , 2006, Neurocomputing.

[22]  Bezalel Gavish,et al.  Parallel Savings Based Heuristics for the Delivery Problem , 1991, Oper. Res..

[23]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[24]  Zhijun Yang,et al.  An ant colony optimization algorithm based on mutation and dynamic pheromone updating , 2004 .

[25]  Michel Gendreau,et al.  An efficient variable neighborhood search heuristic for very large scale vehicle routing problems , 2007, Comput. Oper. Res..

[26]  Ikou Kaku,et al.  Variable neighbourhood simulated annealing algorithm for capacitated vehicle routing problems , 2014 .

[27]  Baozhen Yao,et al.  Production , Manufacturing and Logistics An improved ant colony optimization for vehicle routing problem , 2008 .

[28]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

[29]  Jean-Yves Potvin,et al.  Clustering for vehicle routing with a competitive neural network , 1995, Neurocomputing.

[30]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

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

[32]  Shih-Wei Lin,et al.  Applying hybrid meta-heuristics for capacitated vehicle routing problem , 2009, Expert Syst. Appl..

[33]  Irene Loiseau,et al.  An Ant Colony Algorithm for the Capacitated Vehicle Routing , 2004, Electron. Notes Discret. Math..

[34]  Michel Gendreau,et al.  A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems , 2012, Oper. Res..

[35]  Richard F. Hartl,et al.  Analyzing a Unified Ant System for the VRP and Some of Its Variants , 2003, EvoWorkshops.

[36]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[37]  Richard F. Hartl,et al.  SavingsAnts for the Vehicle Routing Problem , 2002, EvoWorkshops.

[38]  Daniele Vigo,et al.  Chapter 6 Vehicle Routing , 2007, Transportation.

[39]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[40]  Gilbert Laporte,et al.  A tabu search heuristic for the multi-depot vehicle routing problem , 1996, Comput. Oper. Res..

[41]  Michel Gendreau,et al.  Metaheuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[42]  Krzysztof Fleszar,et al.  A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..

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

[44]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[45]  Mohammad R. Akbarzadeh-Totonchi,et al.  Intelligent water drops a new optimization algorithm for solving the Vehicle Routing Problem , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[46]  Éric D. Taillard,et al.  Solving real-life vehicle routing problems efficiently using tabu search , 1993, Ann. Oper. Res..

[47]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[48]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[49]  Gülay Barbarosoglu,et al.  A tabu search algorithm for the vehicle routing problem , 1999, Comput. Oper. Res..