Transportation Routing Problem—A Survey

Abstract In the Transportation Routing Problem, a manager or analyst must schedule an existing fleet of vehicles, each with a capacity constraint, to visit a set of stops or destinations and deliver or pick up goods or services at each stop such that one and only one vehicle visits each stop. The problem is to assign these vehicles to the stops so as to minimize total cost which is assumed to be directly proportional to the total distance traveled. Much work has been done on this problem and heuristic as well as optimal seeking methods have been developed. This paper examines the problem, develops a standard formulation, reviews the literature on the problem, and mentions some new approaches.

[1]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[2]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

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

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

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

[6]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .

[7]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[8]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[9]  T. J. Gaskell,et al.  Bases for Vehicle Fleet Scheduling , 1967 .

[10]  J. F. Pierce.  Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming Problems , 1968 .

[11]  George L. Nemhauser,et al.  The Traveling Salesman Problem: A Survey , 1968, Oper. Res..

[12]  Leonard W. Schruben,et al.  The Lockset Method of Sequential Programming Applied to Routing Delivery and Pickup Trucks , 1968 .

[13]  S. Gorenstein.  Printing Press Scheduling for Multi-Edition Periodicals , 1970 .

[14]  Patrick D. Krolak,et al.  A man-machine approach toward solving the traveling salesman problem , 1970, DAC '70.

[15]  Nicos Christofides,et al.  Technical Note - Bounds for the Travelling-Salesman Problem , 1972, Oper. Res..

[16]  Patrick D. Krolak,et al.  A Man-Machine Approach Toward Solving the Generalized Truck-Dispatching Problem , 1972 .

[17]  Abraham Charnes,et al.  Information Requirements for Urban Systems: A View into the Possible Future? , 1972 .

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

[19]  J. Svestka,et al.  Computational Experience with an M-Salesman Traveling Salesman Algorithm , 1973 .

[20]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..