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

An Effective Tour Construction and Improvement Procedure for the Traveling Salesman Problem

Author

Listed:
  • Geoffrey Zweig

    (International Computer Science Institute, Berkeley, California)

Abstract

This paper presents an effective neighborhood structure for the traveling salesman problem. The neighbors of a tour are defined as the tours that can be produced by breaking the initial tour into two closed subtours, rejoining the subtours in a new configuration, and finally performing local optimization around all the changed edges. This process of generating a neighbor is termed divide and merge . Neighbor lists are used to develop variants of divide and merge that require linear and constant time per iteration, as well as an O ( Nln ( N )) tour construction algorithm based on insertion into the convex hull.

Suggested Citation

  • Geoffrey Zweig, 1995. "An Effective Tour Construction and Improvement Procedure for the Traveling Salesman Problem," Operations Research, INFORMS, vol. 43(6), pages 1049-1057, December.
    • Handle: RePEc:inm:oropre:v:43:y:1995:i:6:p:1049-1057
    DOI: 10.1287/opre.43.6.1049
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.43.6.1049
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.43.6.1049?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. G Babin & S Deneault & G Laporte, 2007. "Improvements to the Or-opt heuristic for the symmetric travelling salesman problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 402-407, March.

    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:43:y:1995:i:6:p:1049-1057. 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.