Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems

This paper examines a class of asymmetrical multi-depot vehicle routing problems and location-routing problems, under capacity or maximum cost restrictions. By using an appropriate graph representation, and then a graph extension, the problems are transformed into equivalent constrained assignment problems. Optimal solutions are then found by means of a branch and bound tree. Problems involving up to 80 nodes can be solved without difficulty.

[1]  Gilbert Laporte,et al.  An exact algorithm for the asymmetrical capacitated vehicle routing problem , 1986, Networks.

[2]  P. Toth,et al.  Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .

[3]  W. Pierskalla,et al.  A Transportation Location-Allocation Model for Regional Blood Banking , 1979 .

[4]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[5]  Gilbert Laporte,et al.  Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..

[6]  G. Laporte,et al.  Exact Algorithms for the Vehicle Routing Problem , 1987 .

[7]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[8]  Bruce L. Golden,et al.  OR Forum - Perspectives on Vehicle Routing: Exciting New Developments , 1986, Oper. Res..

[9]  Marvin D. Nelson,et al.  Implementation techniques for the vehicle routing problem , 1985, Comput. Oper. Res..

[10]  Gilbert Laporte,et al.  Location routing problems , 1987 .

[11]  G. Laporte,et al.  An exact algorithm for solving a capacitated location-routing problem , 1986 .

[12]  E. Lawler,et al.  Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .

[13]  Mark S. Daskin,et al.  A warehouse location-routing problem , 1985 .

[14]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[15]  G. Laporte,et al.  Optimal tour planning with specified nodes , 1984 .

[16]  Jan Karel Lenstra,et al.  Some Simple Applications of the Travelling Salesman Problem , 1975 .

[17]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

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

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