A two-pheromone trail ant colony system—tabu search approach for the heterogeneous vehicle routing problem with time windows and multiple products

This paper considers a practical variant of the Vehicle Routing Problem (VRP) known as the Heterogeneous Vehicle Routing Problem with Time Windows and Multiple Products (HVRPTWMP). As the problem is NP-hard, the resolution approach proposed here is a sequential Ant Colony System (ACS)—Tabu Search algorithm. The approach introduces a two pheromone trail strategy to accelerate agents’ (ants) learning process. Its convergence to good solutions is given in terms of fleet size and travel time while completing tours and service to all customers. The proposed procedure uses regency and frequency memories form Tabu Search to further improve the quality of solutions. Experiments are carried out using instances from literature and show the effectiveness of this procedure.

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

[2]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

[3]  Fuh-Hwa Liu,et al.  A Method for Vehicle Routing Problem with Multiple Vehicle Types and Time Windows , 1999 .

[4]  Zne-Jung Lee,et al.  Improving Ant Colony Optimization Algorithms for Solving Traveling Salesman Problems , 2007, J. Adv. Comput. Intell. Intell. Informatics.

[5]  Jun Zhang,et al.  Ant Colony System for Optimizing Vehicle Routing Problem with Time Windows (VRPTW) , 2006, ICIC.

[6]  Jun Zhang,et al.  Ant Colony System for Optimizing Vehicle Routing Problem with Time Windows , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).

[7]  Hung-da Wan,et al.  An Ant based simulation optimization for Vehicle Routing Problem with stochastic demands , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

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

[9]  Yuvraj Gajpal,et al.  An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup , 2009, Comput. Oper. Res..

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

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

[12]  Jaime Cerdá,et al.  AN OPTIMAL APPROACH TO THE MULTIPLE-DEPOT HETEROGENEOUS VEHICLE ROUTING PROBLEM WITH TIME WINDOW AND CAPACITY CONSTRAINTS , 2003 .

[13]  Sam R. Thangiah,et al.  Vehicle Routing with Time Windows using Genetic Algorithms , 1997 .

[14]  Yazid Mati,et al.  A tabu search heuristic for the single vehicle pickup and delivery problem with time windows , 2001, J. Intell. Manuf..

[15]  Michel Gendreau,et al.  Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

[16]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[17]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[18]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

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

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

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

[22]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[23]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

[24]  Leslie E. Trotter,et al.  On the capacitated vehicle routing problem , 2003, Math. Program..

[25]  Hoong Chuin Lau,et al.  Vehicle routing problem with time windows and a limited number of vehicles , 2003, Eur. J. Oper. Res..

[26]  Mauro Birattari,et al.  Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands , 2004, PPSN.

[27]  Mauro Birattari,et al.  Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands , 2005, J. Math. Model. Algorithms.

[28]  Tong Sun,et al.  Algorithms for the vehicle routing problems with time deadlines , 1993 .

[29]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[30]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[31]  Eiichi Taniguchi,et al.  Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows , 2006 .

[32]  Gilbert Laporte,et al.  What you should know about the vehicle routing problem , 2007 .

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

[34]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[35]  Lars Mönch,et al.  An Ant Colony optimization approach to solve cooperative transportation planning problems , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

[36]  Loo Hay Lee,et al.  Heuristic methods for vehicle routing problem with time windows , 2001, Artif. Intell. Eng..

[37]  Mária Lucká,et al.  Parallel Cooperative Savings Based Ant Colony Optimization - Multiple Search and Decomposition Approaches , 2006, Parallel Process. Lett..

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

[39]  Peter Dayan,et al.  Technical Note: Q-Learning , 2004, Machine Learning.

[40]  Daniela Favaretto,et al.  Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: A Case Study , 2007, KES.

[41]  Jörg Homberger,et al.  Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows , 1999 .

[42]  Peter Dayan,et al.  Q-learning , 1992, Machine Learning.

[43]  Daniela Favaretto,et al.  Ant colony system for a VRP with multiple time windows and multiple visits , 2007 .