Vehicle routing with a sparse feasibility graph

Abstract In this paper we introduce the concept of a feasibility graph for vehicle routing problems, a graph where two customers are linked if and only if it is possible for them to be successive (adjacent) customers on some feasible vehicle route. We consider the problem of designing vehicle routes when the underlying feasibility graph is sparse, i.e. when any customer has only a few other customers to which they can be adjacent on a vehicle route. This problem arose during a consultancy study that involved the design of fixed vehicle routes delivering to contiguous (adjacent) postal districts. A heuristic algorithm for the problem is presented and computational results given for a number of test problems involving up to 856 customers.

[1]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

[2]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[3]  Michael Ian Shamos,et al.  Geometric complexity , 1975, STOC.

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

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

[6]  D. T. Lee,et al.  An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric , 1981, Networks.

[7]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[8]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[9]  Gerhard Reinelt,et al.  Fast Heuristics for Large Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[10]  H. O'Brien,et al.  Distribution models and transport planning , 1975 .

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

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

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[15]  Nicos Christofides.  Fixed routes and areas for delivery operations , 1971 .

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