论文信息 - A new method for routing salespersons - 字舞流文

A new method for routing salespersons

Abstract A new heuristic solution methodology for solving large-scale “traveling salesman” problems is presented. Significant features of the new procedure includes a rapid identification of node location and positive stopping.

[1] T. C. Raymond. Heuristic algorithm for the traveling-salesman problem , 1969 .

[2] Michael Rothkopf,et al. Letter to the Editor - The Traveling Salesman Problem: On the Reduction of Certain Large Problems to Smaller Ones , 1966, Operational Research.

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

[4] S. M. Roberts,et al. An Engineering Approach to the Traveling Salesman Problem , 1966 .

[5] F. Hillier,et al. Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities , 1966 .

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

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

[8] M. M. Flood. The Traveling-Salesman Problem , 1956 .