IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v29y1995i3p267-275.html
   My bibliography  Save this article

The m -Traveling Salesman Problem with Minmax Objective

Author

Listed:
  • Paulo M. França

    (Faculdade de Engenharia Elétrica, Universidade Estadual de Campinas, 13081 Campinas-SP, Brazil)

  • Michel Gendreau

    (Centre de recherche sur les transports, Université de Montréal, Montréal, Canada H3C 3J7)

  • Gilbert Laporte

    (Centre de recherche sur les transports, Université de Montréal, Montréal, Canada H3C 3J7)

  • Felipe M. Müller

    (Departamento de Eletrônica e Computação, Universidade Federal de Santa Maria, Santa Maria-RS, Brazil)

Abstract

This article proposes algorithms for the Minmax version of the m -Traveling Salesman Problem in which the objective is to minimize the length of the longest route. A tabu search heuristic and two exact search schemes are developed. Problems involving up to 50 vertices are solved to optimality.

Suggested Citation

  • Paulo M. França & Michel Gendreau & Gilbert Laporte & Felipe M. Müller, 1995. "The m -Traveling Salesman Problem with Minmax Objective," Transportation Science, INFORMS, vol. 29(3), pages 267-275, August.
    • Handle: RePEc:inm:ortrsc:v:29:y:1995:i:3:p:267-275
    DOI: 10.1287/trsc.29.3.267
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.29.3.267
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.29.3.267?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. Tamke, Felix & Buscher, Udo, 2021. "A branch-and-cut algorithm for the vehicle routing problem with drones," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 174-203.
    2. Ann Melissa Campbell & Dieter Vandenbussche & William Hermann, 2008. "Routing for Relief Efforts," Transportation Science, INFORMS, vol. 42(2), pages 127-145, May.
    3. Mostafa Khatami & Amir Salehipour, 2021. "A binary search algorithm for the general coupled task scheduling problem," 4OR, Springer, vol. 19(4), pages 593-611, December.
    4. He, Pengfei & Hao, Jin-Kao, 2023. "Memetic search for the minmax multiple traveling salesman problem with single and multiple depots," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1055-1070.
    5. 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.

    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:ortrsc:v:29:y:1995:i:3:p:267-275. 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.