论文信息 - An efficient implementation of local search algorithms for constrained routing problems - 字舞流文

An efficient implementation of local search algorithms for constrained routing problems

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

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

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

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

[5] Robert A. Russell,et al. Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions , 1977, Oper. Res..

[6] Harilaos N. Psaraftis,et al. k-Interchange procedures for local search in a precedence-constrained routing problem , 1983 .

[7] Martin W. P. Savelsbergh,et al. Local search in routing problems with time windows , 1984 .

[8] N. Biggs. THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[9] Jan Karel Lenstra,et al. Functional description of CAR : an interactive system for computer aided routing , 1987 .

[10] M M Solomon,et al. VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS: EFFICIENT IMPLEMENTATIONS OF SOLUTION IMPROVEMENT PROCEDURES , 1988 .

[11] Mathieu Willem Paul Savelsbergh,et al. Computer aided routing , 1992 .