A Hybrid Ant Colony System for Partially Dynamic Vehicle Routing Problem

The constraints on responding time involved with dynamic vehicle routing problem (DVRP) require a compromise between distance and time in order to obtain the best solutions as fast as possible, so the flow time and the number of lost customers have gotten the mean to DVRP. Here, we propose a hybrid ant colony system (ACS) initially applied to design a static version of vehicle routing problem (VRP). Then, stochastic information of customers is used to be considered in the partially dynamic version of VRP. Our approach uses some heuristics to reconstruct routes and update pheromone. This approach for solving DVRP with the proper combination of parameters is compared with an insertion heuristic on the benchmark problems of Solomon's instances. The results show that our approach acts well in comparing some heuristic methods.

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

[2]  Gilbert Laporte,et al.  Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows , 2008, INFOR Inf. Syst. Oper. Res..

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

[4]  Liping Fu,et al.  Scheduling dial-a-ride paratransit under time-varying, stochastic congestion , 2002 .

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

[6]  D Sariklis,et al.  A heuristic method for the open vehicle routing problem , 2000, J. Oper. Res. Soc..

[7]  Gilbert Laporte,et al.  An incremental tabu search heuristic for the generalized vehicle routing problem with time windows , 2012, J. Oper. Res. Soc..

[8]  Martin Middendorf,et al.  Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP , 2001, EvoWorkshops.

[9]  Marius Mihai Solomon,et al.  VEHICLE ROUTING AND SCHEDULING WITH TIME WINDOW CONSTRAINTS: MODELS AND ALGORITHMS (HEURISTICS) , 1984 .

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

[11]  Warren B. Powell,et al.  A Stochastic Model of the Dynamic Vehicle Allocation Problem , 1986, Transp. Sci..

[12]  Oli B. G. Madsen,et al.  A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..

[13]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[14]  Moshe Dror,et al.  Stochastic Inventory Routing: Route Design with Stockouts and Route Failures , 1989, Transp. Sci..

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

[16]  Chengbin Chu,et al.  The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments , 2008, Eur. J. Oper. Res..

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

[18]  J Dethloff,et al.  Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls , 2002, J. Oper. Res. Soc..

[19]  Gilbert Laporte,et al.  Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows , 2004, J. Oper. Res. Soc..

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

[21]  Gilbert Laporte,et al.  Ambulance location and relocation models , 2000, Eur. J. Oper. Res..

[22]  Enrique Alba,et al.  Multi-Swarm Optimization for Dynamic Combinatorial Problems: A Case Study on Dynamic Vehicle Routing Problem , 2010, ANTS Conference.

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

[24]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[25]  Harilaos N. Psaraftis,et al.  Dynamic vehicle routing: Status and prospects , 1995, Ann. Oper. Res..

[26]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[27]  Gilbert Laporte,et al.  Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic , 2006, Transp. Sci..

[28]  Oli B. G. Madsen,et al.  A heuristic method for dispatching repair men , 1995, Ann. Oper. Res..

[29]  Richard F. Hartl,et al.  Variable neighborhood search for the dial-a-ride problem , 2010, Comput. Oper. Res..

[30]  Enrique Alba,et al.  Applied Soft Computing a Comparative Study between Dynamic Adapted Pso and Vns for the Vehicle Routing Problem with Dynamic Requests , 2022 .

[31]  Sven Oliver Krumke,et al.  The Online Dial-a-Ride Problem under Reasonable Load , 2000, CIAC.

[32]  Martin W. P. Savelsbergh,et al.  Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints , 2009, Networks.

[33]  Der-Horng Lee,et al.  Multiobjective Vehicle Routing and Scheduling Problem with Time Window Constraints in Hazardous Material Transportation , 2005 .

[34]  Gilbert Laporte,et al.  A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows , 2001 .

[35]  Burak Eksioglu,et al.  The vehicle routing problem: A taxonomic review , 2009, Comput. Ind. Eng..

[36]  Michel Gendreau,et al.  A dynamic model and parallel tabu search heuristic for real-time ambulance relocation , 2001, Parallel Comput..

[37]  Jean-Yves Potvin,et al.  Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier , 2011, J. Oper. Res. Soc..

[38]  Haldun Süral,et al.  The single‐vehicle routing problem with unrestricted backhauls , 2003, Networks.

[39]  Gilbert Laporte,et al.  Waiting strategies for the dynamic pickup and delivery problem with time windows , 2004 .

[40]  Chelsea C. White,et al.  Optimal vehicle routing with real-time traffic information , 2005, IEEE Transactions on Intelligent Transportation Systems.

[41]  Vinícius Amaral Armentano,et al.  Adaptive granular local search heuristic for a dynamic vehicle routing problem , 2009, Comput. Oper. Res..

[42]  Maria Grazia Speranza,et al.  Complexity and Reducibility of the Skip Delivery Problem , 2005, Transp. Sci..

[43]  Di Yuan,et al.  Scheduling de-icing vehicles within airport logistics: a heuristic algorithm and performance evaluation , 2012, J. Oper. Res. Soc..

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

[45]  Nicola Secomandi,et al.  Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands , 2009, Oper. Res..

[46]  Beatrice M. Ombuki-Berman,et al.  Dynamic vehicle routing using genetic algorithms , 2007, Applied Intelligence.

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

[48]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .

[49]  B. Yu,et al.  A parallel improved ant colony optimization for multi-depot vehicle routing problem , 2011, J. Oper. Res. Soc..

[50]  Michel Gendreau,et al.  A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands , 2010, Transp. Sci..

[51]  Russell Bent,et al.  Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers , 2004, Oper. Res..

[52]  Kay Chen Tan,et al.  Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation , 2007, Eur. J. Oper. Res..

[53]  Jon C. Yingling,et al.  Routing for a Just-in-Time Supply Pickup and Delivery System , 2005, Transp. Sci..

[54]  Russell Bent,et al.  A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows , 2004, Transp. Sci..

[55]  Marius M. Solomon,et al.  Classification Of Dynamic Vehicle Routing Systems , 2007 .

[56]  Bernhard Fleischmann,et al.  Dynamic Vehicle Routing Based on Online Traffic Information , 2004, Transp. Sci..

[57]  R. Roy.  A Primer on the Taguchi Method , 1990 .

[58]  Michel Gendreau,et al.  DYNAMIC VEHICLE ROUTING AND DISPATCHING , 1998 .

[59]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..