Technical Note - Heuristics for Delivery Problems with Constant Error Guarantees

In this paper Q Iterated Optimal Tour Partitioning, and Best Optimal Tour Partitioning algorithms are studied and analyzed for their worst case error. Both algorithms are based on partitioning an optimal traveling salesman tour in order to generate a feasible solution to the unit weight delivery problem. They have a worst case error bound of 2 − 1/ Q where Q is the maximal number of customers a vehicle could visit and N is the total number of customers. Similar worst case error bounds are shown when the algorithms are applied to an α-optimal traveling salesman tour.

[1]  Leen Stougie,et al.  ANALYSIS OF HEURISTICS FOR VEHICLE ROUTING PROBLEMS. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[2]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[3]  Alexander H. G. Rinnooy Kan,et al.  Bounds and Heuristics for Capacitated Routing Problems , 1985, Math. Oper. Res..

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

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

[6]  Bezalel Gavish,et al.  An approach for solving a class of transportation scheduling problems , 1979 .

[7]  Bezalel Gavish,et al.  Parallel Savings Based Heuristics for the Delivery Problem , 1991, Oper. Res..

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

[9]  G. L. Nemhauser,et al.  Tight bounds for christofides' traveling salesman heuristic , 1978, Math. Program..

[10]  Richard H Mole,et al.  Combinatorial analysis for route first-cluster second vehicle routing , 1983 .

[11]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[12]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[13]  B. Gavish,et al.  Heuristics for unequal weight delivery problems with a fixed error guarantee , 1987 .

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

[15]  Bezalel Gavish,et al.  Scheduling and Routing in Transportation and Distribution Systems: Formulations and New Relaxations , 1981 .

[16]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..