113
Views
45
CrossRef citations to date
0
Altmetric
Original Articles

Geometric Approaches to Solve the Chebyshev Traveling Salesman Problem

, &
Pages 238-254 | Received 01 Aug 1986, Published online: 30 May 2007

REFERENCES

  • Allison , D. C. S. and Noga , M. T. , “The Rectilinear Traveling Salesman Problem . ” Information Processing Letters , Vol. 18 , No. 4 , 1984 , pp. 195 – 199 .
  • Bachers , R. Dangelmaier , W. and Warneeke , H. J. , “ Selectionand Use of Order Picking Strategies in a High-Bay Warehouse , ” Proceedings of Material Handling Focus '85, Material Handling Research Center and Georgia Institute of Technology , Atlanta , GA , September 18 – 20 , 1985 .
  • Barachet , L. L. , “ Graphic Solution of the Traveling Salesman Problem , ” Operations Research , Vol. 5 , 1957 , pp. 841 – 845 .
  • Barrett , B. G. , “ A Further Digression on the Over-Automated Warehouse Some Evidence , ” Interfaces , Vol. 8 , No. 1 , 1977 , pp. 46 – 49 .
  • Bartholdi , III , J. J. , Personal Communication , 1985 .
  • Bartholdi , III , J. J. , rind Platzman , L. K. , “ An O(nlogn) Planar Traveling Salesman Heuristic Based on Spacefilling Curves , ” Operations Research Letters , Vol. 1 , No. 4 , 1983 , pp. 121 – 125 .
  • Bozer , Y. A. , “ Optimizing Throughput Performance in Designing Order Picking Systems , ” Unpublished Ph,D, dissertation , Georgia Institute of Technology , Atlanta , GA , 1985 .
  • Bozer , Y. A. and White , J. A. , “ Travel-Time Models for Automated Storage/Retrieval Systems , ” IIE Transactions , Vol. 16 , No. 4 , 1984 , pp. 329 – 338 .
  • Christofides , N. , “ Worst-Cnse Analysis of a New Heuristic for the Traveling Salesman Problem , ” Management Sciences Research Report No. 388 , Carnegie-Mellon University . February 1976 .
  • Croes , G. A. , “ A Method for Solving Traveling-Salesman Problems , ” Operations Research , Vol. 6 , No. 6 , 1958 , pp. 791 – 812 .
  • Dearing , P. M. , Francis , R L. , “ A Network Flow Solution to a Multifacilily Minimax Location Problem Involving RectilinearDis-tances , ” Transportation Science , Vol. 8 , 1974 , pp. 126 – 141 .
  • Garey , M. R. , Graham , R. L. and Johnson , D. S. , “ Some NP-Complete Geometric Problems , ” Proceedings of the 8th SIGACT Symposium on the Theory of Computing , 1976 , pp. 10 – 22 .
  • Garey , M. R. and Johnson , D. S. , Computers and Intractability A Guide to the Theory of NP-Completeness , W.H. Freeman and Co. , 1979 .
  • Gillett , B. E. and Miller , L. R. , “ A Heuristic Algorithm for the Vehicle Dispatch Problem , ” OperationsResearch , Vol. 22 , No. 2 , 1974 , pp. 340 – 349 .
  • Goetschalckx , M. P. , “ Storage and Retrieval Policies for Efficient Order Picking , ” Unpublished Ph.D. dissertation , Georgia Institute of Technology , Atlanta , GA , 1983 .
  • Goetschalclcx , M. P. , “ Sequencing Picking Operations in a Man-Aboard Order Picking System , ” Technical Report MHRC-TR-85-17, Material Handling Research Center , Georgia Institute of Technology , Atlanta , GA , 1985 .
  • Golden , B. , Bodin , L. , Doyle , T. , Stewart , Jr. W. , “ Approxi-mnte Traveling Salesman Algorithms , ” Operations Research , Vol. 28 , NO. 3 , 1980 , pp. 694 – 711 .
  • Golden , B. L. and Stewart , W. R. , “ Empirical Analysis of (TSP) Heuristics , ” in The Traveling Salesman Problem , Edited by E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys , John Wiley , 1985 .
  • Gudehus , T. , Principles of Order Picking Operations in Distribution and Warehousing Systems , (in German), W. Girardet, Essen , West Germany , 1973 .
  • Karp , R. , Reducibility Among Combinatorial Problem . Complexity of Computer Computations , pp. 85 – 104 , Mffler, R. and Thatcher, J. (eds.) , Plenum Press , New York , 1972 .
  • Lin , S. , “ Computer Solutions of the Traveling Salesman Problem , ” Bell System Technical Journal , Vol. 44 , 1965 , pp. 2245 – 2269 .
  • Little , J. D. C. , Murty , K. G. , Sweeney , D. W. and Caroline , K. “ An Algorithm for the Traveling Salesman Problem , ” Operations Research . Vol. II , No. 6 , 1963 , pp, 972 – 989 .
  • Montgomery , D. C. , Design and Analysis of Experiments , 2nd Ed. , John Wiley , 1984 , pp. 86 – 91 .
  • Norback , J. P. and Love , R F. , “ Geometric Approaches to Solving the Traveling Salesman Problem , ” Management Science , Vol. 23 , NO. 11 , 1977 , pp, 1208 – 1223 .
  • Or , I. , “ Traveling Salesman-TypeCombinalorial Problems and Their Relation to the Logistics of Regional Blood Banking , ” Unpublished Ph.D, dissertation, Department of Industrial Engineering and Management Sciences , Northwestern University , 1976 .
  • Papadimitriou , C. H. , “ The Euclidean Traveling Salesman Problem is NP-Complete , ” Theoretical Computer Science , Vol. 4 , No. 3 , 1977 , pp. 237 – 244 .
  • Parker , R G. and Raidin , R L. , “ The Traveling Salesman Problem An Update of Research , ” Naval Research Logistics Quarterly , Vol. 30 , 1983 , pp. 69 – 96 .
  • Stewart , Jr. , W. , “ A Computationally Efficient Heuristic for the Traveling Salesman Problem , ” Proceedings of the 13th Annual Meeting of Southeastern TIMS , South Carolina , 1977 , pp. 75 – 83 .
  • Stinson , J. , “ A Heuristic Algorithm for Obtaining an Initial Solution for the Traveling Salesman Problem , ” presented at the Joint National ORSA/TLMS meeting , New York , May 1978 .
  • Syslo , M. M. , Deo , N. and Kowalik , J. S. , Discrete Optimization Algorithm with Pascal Programs , Prentice-Hall , 1983 .
  • Wong , C. K. , “ Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems ,” Computing Surveys , Vol 12 , No. 2 , 1980 , pp. 167 – 178 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.