IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v6y1958i6p791-812.html
   My bibliography  Save this article

A Method for Solving Traveling-Salesman Problems

Author

Listed:
  • G. A. Croes

    (Exploration and Production Research Division, Shell Development Company, Houston, Texas)

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.

Suggested Citation

  • G. A. Croes, 1958. "A Method for Solving Traveling-Salesman Problems," Operations Research, INFORMS, vol. 6(6), pages 791-812, December.
    • Handle: RePEc:inm:oropre:v:6:y:1958:i:6:p:791-812
    DOI: 10.1287/opre.6.6.791
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.6.6.791
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.6.6.791?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:6:y:1958:i:6:p:791-812. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.