Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
暂无分享,去创建一个
[1] S. Gorenstein. Printing Press Scheduling for Multi-Edition Periodicals , 1970 .
[2] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[3] P. C. Yellow,et al. A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .
[4] C. S. Orloff. Routing a fleet of M vehicles to/from a central facility , 1974, Networks.
[5] J. F. Pierce. Direct search algorithms for truck-dispatching problems , 1969 .
[6] Billy E. Gillett,et al. A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..
[7] T. J. Gaskell,et al. Bases for Vehicle Fleet Scheduling , 1967 .
[8] Nicos Christofides,et al. An Algorithm for the Vehicle-dispatching Problem , 1969 .
[9] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[10] J. Svestka,et al. Computational Experience with an M-Salesman Traveling Salesman Algorithm , 1973 .
[11] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .
[12] Mandell Bellmore,et al. Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem , 1974, JACM.
[13] George B. Dantzig,et al. The Truck Dispatching Problem , 1959 .
[14] Thomas L. Magnanti,et al. Implementing vehicle routing algorithms , 1977, Networks.
[15] Patrick D. Krolak,et al. A Man-Machine Approach Toward Solving the Generalized Truck-Dispatching Problem , 1972 .