Saving based algorithm for multi-depot version of vehicle routing problem with simultaneous pickup and delivery

The paper presents saving based algorithm for the multi-depot version of VRPSPD. We developed four saving based algorithms for the problem. These algorithms are: 1) partition based algorithm; 2) nearest depot algorithm; 3) saving algorithm; 4) Tillman's saving algorithm. In the saving heuristics, a new route is created by merging two routes. Checking the feasibility of new route obtained after merging two routes is difficult because of the fluctuating load on the route. We use cumulative-net pick approach for checking the feasibility when two existing routes are merged. Numerical experiment is performed on benchmark problem instances available in literature. The numerical results show that the performance of the proposed heuristics is qualitatively better than the existing insertion based heuristics.

[1]  Bruce L. Golden,et al.  OR Practice - Computerized Vehicle Routing in the Soft Drink Industry , 1987, Oper. Res..

[2]  Saïd Salhi,et al.  Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries , 2005, Eur. J. Oper. Res..

[3]  P. J. Cassidy,et al.  TRAMP-A MULTI-DEPOT VEHICLE SCHEDULING SYSTEM , 1972 .

[4]  Bruce L. Golden,et al.  VEHICLE ROUTING WITH BACKHAULS: MODELS, ALGORITHMS, AND CASE STUDIES. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

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

[6]  Said Salhi,et al.  A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling , 1999, J. Oper. Res. Soc..

[7]  Saïd Salhi,et al.  Genetic clustering: An adaptive heuristic for the multidepot vehicle routing problem , 2001 .

[8]  Giovanni Righini,et al.  A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection , 2006, Transp. Sci..

[9]  F. A. Tillman,et al.  An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem , 1972 .

[10]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[11]  Thomas L. Magnanti,et al.  Combinatorial optimization and vehicle fleet planning: Perspectives and prospects , 1981, Networks.

[12]  Gur Mosheiov,et al.  Vehicle routing with pick-up and delivery: tour-partitioning heuristics , 1998 .

[13]  Jan Dethloff,et al.  Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up , 2001, OR Spectr..

[14]  Fermín Alfredo Tang Montané,et al.  A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service , 2006, Comput. Oper. Res..

[15]  Said Salhi,et al.  A multi-level composite heuristic for the multi-depot vehicle fleet mix problem , 1997 .

[16]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

[17]  John Pooley,et al.  Integrated Production and Distribution Facility Planning at Ault Foods , 1994 .

[18]  Bruce L. Golden,et al.  A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions , 1993 .

[19]  Louis M. Dalberto,et al.  Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer , 1983 .

[20]  B. Gillett,et al.  Multi-terminal vehicle-dispatch algorithm , 1976 .

[21]  José Brandão,et al.  Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls , 2005, J. Oper. Res. Soc..

[22]  Giovanni Righini,et al.  Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery , 2007, Comput. Oper. Res..

[23]  J. Current,et al.  THE MULTIPLE DEPOT VEHICLE ROUTING PROBLEM WITH BACKHAULING. , 1992 .

[24]  Lawrence Bodin,et al.  PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTION , 1983 .

[25]  J-F Chen,et al.  Vehicle routing problem with simultaneous deliveries and pickups , 2006, J. Oper. Res. Soc..

[26]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[27]  Yuvraj Gajpal.  Algorithms for vehicle routing problem with pickup and delivery , 2008 .

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

[29]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[30]  David Pisinger,et al.  A unified heuristic for a large class of Vehicle Routing Problems with Backhauls , 2006, Eur. J. Oper. Res..

[31]  Said Salhi,et al.  An ant system algorithm for the mixed vehicle routing problem with backhauls , 2004 .

[32]  F. A. Tillman,et al.  A study of a look-ahead procedure for solving the multiterminal delivery problem , 1971 .

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

[34]  Gábor Nagy,et al.  A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries , 2008, J. Comb. Optim..

[35]  Gerald G. Brown,et al.  Real-Time, Wide Area Dispatch of Mobil Tank Trucks , 1987 .

[36]  G. Dueck.  New optimization heuristics , 1993 .

[37]  F. Tillman.  The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .

[38]  Hokey Min,et al.  The multiple vehicle routing problem with simultaneous delivery and pick-up points , 1989 .

[39]  Ole M. Raft.  A modular algorithm for an extended vehicle scheduling problem , 1982 .

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

[41]  Ramchandran Jaikumar,et al.  A COMPUTERIZED VEHICLE ROUTING APPLICATION , 1982 .