Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms

The time dependent vehicle routing problem (TDVRP) is defined as follows. A vehicle fleet of fixed capacities serves customers of fixed demands from a central depot. Customers are assigned to vehicles and the vehicles routed so that the total time of the routes is minimized. The travel time between two customers or between a customer and the depot depends on the distance between the points and time of day. Time windows for serving the customers may also be present. The time dependent traveling salesman problem (TDTSP) is a special case of the TDVRP in which only one vehicle of infinite capacity is available. Mixed integer linear programming formulations of the TDVRP and the TDTSP are presented that treat the travel time functions as step functions. The characteristics and properties of the TDVRP preclude modification of most of the algorithms that have been developed for the vehicle routing problem. Several simple heuristic algorithms are given for the TDTSP and TDVRP without time windows based on the nearest-neighbor heuristic. A mathematical-programming-based heuristic for the TDTSP without time windows using cutting planes is also briefly discussed. Test results on small, randomly generated problems are reported.

[1]  Roy E. Marsten,et al.  The Design of the XMP Linear Programming Library , 1981, TOMS.

[2]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[3]  Selmer M. Johnson,et al.  On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem , 1959 .

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

[5]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[6]  Edward K. Baker,et al.  Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints , 1986 .

[7]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

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

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

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

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

[12]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[13]  Bezalel Gavish,et al.  An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems , 1986, Oper. Res..

[14]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

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

[16]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[17]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[18]  Marius M. Solomon,et al.  On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints , 1986, Networks.

[19]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[20]  Egon Balas,et al.  A restricted Lagrangean approach to the traveling salesman problem , 1981, Math. Program..

[21]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

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

[23]  Lawrence Bodin,et al.  THE STATE OF THE ART IN THE ROUTING AND SCHEDULING OF VEHICLES AND CREWS: EXECUTIVE SUMMARY , 1981 .

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

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

[26]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[27]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

[28]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

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

[30]  Alexander H. G. Rinnooy Kan,et al.  Vehicle Routing with Time Windows , 1987, Oper. Res..

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

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

[33]  Chryssi Malandraki,et al.  Time dependent vehicle routing problems : formulations, solution algorithms and computational experiments , 1989 .

[34]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

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

[36]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .