A Robust Multiple Ant Colony System for the Capacitated Vehicle Routing Problem

In transportation problems like the vehicle routing problem, the decision makers are increasingly adopting the idea that the problem data can be subject to uncertainty. The uncertainty can be encountered because of events that are not exactly predictable, like weather conditions, traffic jams, etc. In this paper, we study vehicle routing problem with uncertain travel costs. Then, to solve the problem, we propose a robust multiple ant colony system: a metaheuristic in which multiple ant colonies work in parallel to generate a collection of solutions with different levels of protection against the uncertainty. The uncertainty is handled by incorporating linear formulations from the field of robust optimization into the metaheuristic approach.

[1]  Nicolas Jozefowiez,et al.  The vehicle routing problem: Latest advances and new challenges , 2007 .

[2]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[3]  F. Ordóñez,et al.  A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty , 2008 .

[4]  John M. Wilson,et al.  Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..

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

[6]  Allen L. Soyster,et al.  Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..

[7]  Seyed Jafar Sadjadi,et al.  Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm , 2012, Comput. Ind. Eng..

[8]  Roberto Montemanni,et al.  An ant colony system for the capacitated vehicle routing problem with uncertain travel costs , 2013, 2013 IEEE Symposium on Swarm Intelligence (SIS).

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

[10]  Paolo Toth,et al.  Exact algorithms for routing problems under vehicle capacity constraints , 2010, Ann. Oper. Res..

[11]  Laurent El Ghaoui,et al.  Robust Solutions to Least-Squares Problems with Uncertain Data , 1997, SIAM J. Matrix Anal. Appl..

[12]  Shen Lin Computer solutions of the traveling salesman problem , 1965 .

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

[14]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[15]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[16]  Arkadi Nemirovski,et al.  Robust Truss Topology Design via Semidefinite Programming , 1997, SIAM J. Optim..

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

[18]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..

[19]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[20]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[21]  Nicos Christofides,et al.  An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..

[22]  Marielle Christiansen,et al.  The robust vehicle routing problem with time windows , 2013, Comput. Oper. Res..

[23]  Kyungsik Lee,et al.  Robust vehicle routing problem with deadlines and travel time/demand uncertainty , 2012, J. Oper. Res. Soc..

[24]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[25]  G. Croes A Method for Solving Traveling-Salesman Problems , 1958 .

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