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

Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem

Author

Listed:
  • Roy Jonker

    (University of Amsterdam, The Netherlands)

  • Ton Volgenant

    (University of Amsterdam, The Netherlands)

Abstract

We improve the standard transformation of the symmetric, single-depot, multiple traveling salesman problem (MTSP) to one on a sparser edge configuration. The improvement tends to suppress, to a large extent, the degeneracy of the resulting symmetric traveling salesman problem (TSP). As a result, a 1-tree based TSP algorithm solves large MTSPs of the type we consider as easily as it solves standard TSPs. We demonstrate the improvement by presenting computational results that are currently the best available.

Suggested Citation

  • Roy Jonker & Ton Volgenant, 1988. "Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem," Operations Research, INFORMS, vol. 36(1), pages 163-167, February.
    • Handle: RePEc:inm:oropre:v:36:y:1988:i:1:p:163-167
    DOI: 10.1287/opre.36.1.163
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.36.1.163
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.36.1.163?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. Antonio Martinez‐Sykora & Tolga Bektaş, 2015. "Transformations of node‐balanced routing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(5), pages 370-387, August.
    2. José Alejandro Cornejo-Acosta & Jesús García-Díaz & Julio César Pérez-Sansalvador & Carlos Segura, 2023. "Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems," Mathematics, MDPI, vol. 11(13), pages 1-25, July.

    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:36:y:1988:i:1:p:163-167. 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.