Transportation Routing Problem—A Survey

References

• Ashour , S. , and Parker , R. G. , “ A Schedule Algebra Approach to the Traveling Salesman Problem ,” Unpublished working paper, Department of Industrial Engineering, Kansas State University, Kansas.
   Google Scholar
• Bellman , R. , “ Dynamic Programming Treatment of the Traveling Salesman Problem ,” J. Assoc. Comp. Mach. , 9 , 61 – 63 ( 1962 ).
   Web of Science ®Google Scholar
• Bellmore , M. , and Malone , J. C. , “ Pathology of Traveling Salesman Subtour Elimination Procedures ,” Operations Research , 19 , 2 ( March-April 1971 ).
   Web of Science ®Google Scholar
• Bellmore , M. , and Nemhauser , G. L. , “ The Traveling Salesman Problem: A Survey ,” Operations Research , 16 , 3 , 538 – 558 ( 1968 ).
   Web of Science ®Google Scholar
• Christofides , N. , “ Bounds for the Traveling Salesman Problem ,” Operations Research , 20 , 5 , 1044 – 1056 ( 1972 ).
   Web of Science ®Google Scholar
• Clark , G. , and Wright , J. , “ Scheduling of Vehicles from a Central Depot to a Number of Delivery Points ,” Operations Research , 12 , 568 ( 1964 ).
   Web of Science ®Google Scholar
• Croes , G. A. , “ A Method for Solving Traveling Salesman Problems ,” Operations Research , 6 , 791 – 812 ( 1958 ).
   Web of Science ®Google Scholar
• Dantzig , G. , and Ramser , J. , “ The Truck Dispatching Problem ,” Management Science , 6 , 80 ( 1959 ).
   Web of Science ®Google Scholar
• Eastman , W. L. , “ A Solution to the Traveling Salesman Problem ,” Presented at the American Summer Meeting of the Econometric Society, Cambridge, Massachusetts ( August 1958 ).
   Google Scholar
• Eilon , Samuel , Watson-Gandy , S. D. T. , Christofides , Nicos , Distribution Management , Griffin , London ( 1971 ).
   Google Scholar
• Gaskell , T. , “ Bases for Vehicle Fleet; Scheduling ,” Operational Research Quarterly , 18 , 407 ( 1957 ).
   Google Scholar
• Gillett , B. E. , and Miller , L. R. , “ A Heuristic Algorithm for the Vehicle Dispatch Problem ,” Operations Research , 22 , 340 – 349 ( 1974 ).
   Web of Science ®Google Scholar
• Gorenstein , S. , “ Printing Press Scheduling for Multi-Edition Periodicals ,” Management Science , 16 , B373 – 383 ( 1970 ).
   Web of Science ®Google Scholar
• Graf , T. F. , “ Labor Management Economics in the Dairy Industry ,” University of Wisconsin., Department of Agricultural Economics , Staff Paper Series No. 2 ( December 1965 ).
   Google Scholar
• Hallberg , M. C. , and Gentry , G. T. , “ Efficient Routing Systems for Retail Milk Delivery ,” Department of Agricultural Economics and Rural Sociology, Agricultural Experimental Station, The Pennsylvania State University, University Park , Pennsylvania ( June 1970 ).
   Google Scholar
• Hallberg , M. C. , and Kriebel , W. R. , “ Designing Efficient Pick Up and Delivery Route Systems by Computer ,” Department of Agricultural Economics and Rural Sociology, Agricultural Experimental Station, The Pennsylvania State University , Pennsylvania .
   Google Scholar
• Hayes , R. , “ The Delivery Problem ,” Carnegie Institute of Technology, Graduate School of Industrial Administration, Pittsburg, Report No. MSR 106 ( 1967 ).
   Google Scholar
• Hougland , E. , Turner , W. C. , and Case , K. E. , “ Routing of Solid Waste Collection Vehicles: Development and Applications ,” International Symposium on Applications of Computers and Operations Research to Problems of World Concern , Washington , D. C. ( August 20-21, 1973 ).
   Google Scholar
• Karg , R. , and Thompson , G. , “ A Heuristic Approach to Solving Traveling Salesman Problems ,” Management Science , 10 , 225 – 247 ( 1964 ).
   Web of Science ®Google Scholar
• Knowles , K. , “ The Use of a Heuristic Tree-Search Algorithm for Vehicle Routing and Scheduling ,” Operational Research: Conference, Exeter, England ( 1967 ).
   Google Scholar
• Krolak , P. , Felts , W. , and Marble , G. , “ A Man-Machine Approach Toward Solving The Traveling Salesman Problem ,” CACM , 14 , 327 – 334 ( 1971 ).
   Web of Science ®Google Scholar
• Krolak , P. , Felts , W. , and Nelson , J. , “ A Man-Machine Approach Toward Solving the Generalized Truck-Dispatching Problem ,” Transportation Science , 6 , 21 , 149 ( May 1972 ).
   Google Scholar
• Lawter , E. L. , and Wood , D. E. , “ Branch and Bound Methods: A Survey ,” Operations Research , 14 , 4 , 699 – 719 ( 1966 ).
   Web of Science ®Google Scholar
• Lin , S. , “ Computer Solutions of the Traveling Salesman Problem ,” Bell Systems Technical Journal , 44 , 2245 – 2269 ( 1965 ).
   Google Scholar
• Lin , S. , and Kernighám , B. , “ An Effective Heuristic Algorithm for the Traveling Salesman Problem ,” Operations Research , 21 , 2 , 498 ( March-April 1973 ).
   Web of Science ®Google Scholar
• Little , J. D. C. , Murty , K. G. , Sweeney , D. W. , and Karel , C. , “ An Algorithm for the Traveling Salesman Problem ,” Operations Research , 11 , 972 – 989 ( 1963 ).
   Web of Science ®Google Scholar
• MacPherson , D. D. , “ Milk Distribution Operations ,” U.S. Department of Agriculture, Economic Research Service , ERS 84 ( November 1962 ).
   Google Scholar
• Miller , C. , Tucker , A. , and Zemlin , R. , “ Integer Programming Formulations and Traveling Salesman Problems ,” T. Ass. Comput. Mach. , 7 , 326 – 329 ( 1960 ).
   Web of Science ®Google Scholar
• Pierce , J. F. , “ On The Truck Dispatching Problem—Part 1 ,” IBM Cambridge Scientific Center , Report 320-2018 , Cambridge , Massachusetts ( 1967 ).
   Google Scholar
• Pierce , J. F. , “ Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming Problems ,” Management Science , 15 , 191 ( November 1968 ).
   Web of Science ®Google Scholar
• Pierce , J. F. , and Hatfield , D. J. , “ Production Sequencing by Combinatorial Programming ,” IBM Cambridge Scientific Center , Report 320-2000, Cambrdige , Massachusetts ( 1966 ).
   Google Scholar
• Reiter , S. , and Sherman , G. , “ Discrete Optimizing ,” SIAM Review , 13 , 864 – 889 ( 1965 ).
   Google Scholar
• Salzborn , F. J. M. , “ Optimal Bus Scheduling ,” Transportation Science , 6 , ( 1972 ).
   Google Scholar
• Salzborn , F. J. M. , “ A Note on Fleet Routing Models for Transportation Systems ,” Transportation Science , 7 , 335 ( 1973 ).
   Google Scholar
• Schruben , and Clifton , “ The Lockset Method of Sequential Programming Applied to Routing Delivery and Pick-up Trucks ,” American Journal of Agricultural Economics , 50 , 4 , 854 – 865 ( November 1968 ).
   Web of Science ®Google Scholar
• Shapiro , D. , “ Algorithms for the Solution of the Optimal Cost Traveling Salesman Problem ,” ScD Thesis, Washington University, St. Louis ( 1966 ).
   Google Scholar
• Svestka , J. , and Huckfeldt , V. E. , “ Computational Experience with an M-Salesman Traveling Salesman Algorithm ,” Management Science , 19 , 7 ( March 1973 ).
   Web of Science ®Google Scholar
• Tillman , F. , and Chochran , H. , “ A Heuristic Approach for Solving the Delivery Problem ,” J. Ind. Engineering , 19 , 354 ( 1968 ).
   Google Scholar