Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Method for Solving Traveling-Salesman Problems

G. A. Croes
Operations Research
Vol. 6, No. 6 (Nov. - Dec., 1958), pp. 791-812
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/167074
Page Count: 22
  • Download ($30.00)
  • Cite this Item
A Method for Solving Traveling-Salesman Problems
Preview not available

Abstract

The traveling-salesman problem is a generalized form of the simple problem to find the smallest closed loop that connects a number of points in a plane. Efforts in the past to find an efficient method for solving it have met with only partial success. The present paper describes a method of solution that has the following properties: (a) It is applicable to both symmetric and asymmetric problems with random elements. (b) It does not use subjective decisions, so that it can be completely mechanized. (c) It is appreciably faster than any other method proposed. (d) It can be terminated at any point where the solution obtained so far is deemed sufficiently accurate.

Page Thumbnails

  • Thumbnail: Page 
791
    791
  • Thumbnail: Page 
792
    792
  • Thumbnail: Page 
793
    793
  • Thumbnail: Page 
794
    794
  • Thumbnail: Page 
795
    795
  • Thumbnail: Page 
796
    796
  • Thumbnail: Page 
797
    797
  • Thumbnail: Page 
798
    798
  • Thumbnail: Page 
799
    799
  • Thumbnail: Page 
800
    800
  • Thumbnail: Page 
801
    801
  • Thumbnail: Page 
802
    802
  • Thumbnail: Page 
803
    803
  • Thumbnail: Page 
804
    804
  • Thumbnail: Page 
805
    805
  • Thumbnail: Page 
806
    806
  • Thumbnail: Page 
807
    807
  • Thumbnail: Page 
808
    808
  • Thumbnail: Page 
809
    809
  • Thumbnail: Page 
810
    810
  • Thumbnail: Page 
811
    811
  • Thumbnail: Page 
812
    812