An ant colony system for responsive dynamic vehicle routing

We present an algorithm based on an ant colony system to deal with a broad range of Dynamic Capacitated Vehicle Routing Problems with Time Windows, (partial) Split Delivery and Heterogeneous fleets (DVRPTWSD). We address the important case of responsiveness. Responsiveness is defined here as completing a delivery as soon as possible, within the time window, such that the client or the vehicle may restart its activities. We develop an interactive solution to allow dispatchers to take new information into account in real-time. The algorithm and its parametrization were tested on real and artificial instances. We first illustrate our approach with a problem submitted by Liege Airport, the 8th biggest cargo airport in Europe. The goal is to develop a decision system to optimize the journey of the refueling trucks. We then consider some classical VRP benchmarks with extensions to the responsiveness context.

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

[2]  Roberto Roberti,et al.  Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints , 2012, Eur. J. Oper. Res..

[3]  Gilles Pesant,et al.  Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming , 2011, Transp. Sci..

[4]  Patrick Prosser,et al.  Dynamic VRPs: A Study of Scenarios , 1998 .

[5]  Roberto Musmanno,et al.  Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies , 2003, Eur. J. Oper. Res..

[6]  Roberto Montemanni,et al.  Ant Colony System for a Dynamic Vehicle Routing Problem , 2005, J. Comb. Optim..

[7]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[8]  Roberto Montemanni,et al.  Time dependent vehicle routing problem with a multi ant colony system , 2008, Eur. J. Oper. Res..

[9]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

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

[11]  Roberto Montemanni,et al.  Ant colony optimization for real-world vehicle routing problems , 2007, Swarm Intelligence.

[12]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[13]  André Bergsten Mendes,et al.  Column Generation for a Multitrip Vehicle Routing Problem with Time Windows, Driver Work Hours, and Heterogeneous Fleet , 2013 .

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

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

[16]  Dong-wan Tcha,et al.  A column generation approach to the heterogeneous fleet vehicle routing problem , 2007, Comput. Oper. Res..

[17]  Michel Gendreau,et al.  A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands , 2013, Comput. Oper. Res..

[18]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[19]  Yuvraj Gajpal,et al.  Multi-ant colony system (MACS) for a vehicle routing problem with backhauls , 2009, Eur. J. Oper. Res..

[20]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

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

[22]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[23]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[24]  Maria Grazia Speranza,et al.  Vehicle routing problems with split deliveries , 2012, Int. Trans. Oper. Res..

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

[26]  Matteo Salani,et al.  Branch and price for the vehicle routing problem with discrete split deliveries and time windows , 2011, Eur. J. Oper. Res..

[27]  Gilbert Laporte,et al.  A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem , 2012, INFORMS J. Comput..

[28]  Gong Yan-cheng.  On Vehicle Routing Problems with Time Windows , 2005 .

[29]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[30]  Bruce L. Golden,et al.  The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results , 2011, Comput. Ind. Eng..

[31]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

[32]  Roberto Montemanni,et al.  Ant colony optimization for vehicle routing in advanced logistics systems , 2003 .

[33]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[34]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[35]  Moshe Dror,et al.  Vehicle routing with split deliveries , 1994, Discret. Appl. Math..

[36]  George M. Giaglis,et al.  Minimizing logistics risk through real‐time vehicle routing and mobile technologies: Research to date and future trends , 2004 .

[37]  Youssef Benadada,et al.  Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles , 2013, INFOR Inf. Syst. Oper. Res..

[38]  Brian Kallehauge,et al.  The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.