IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v50y2018i1p45-53.html
   My bibliography  Save this article

Solving the single and multiple asymmetric Traveling Salesmen Problems by generating subtour elimination constraints from integer solutions

Author

Listed:
  • Maichel M. Aguayo
  • Subhash C. Sarin
  • Hanif D. Sherali

Abstract

We present an algorithm to solve single and multiple asymmetric traveling salesmen problems (ATSP and mATSP) by generating violated subtour elimination constraints from specific integer solutions. Computational results for the ATSP reveal that the proposed approach is able to solve 29 out of 33 well-known instances taken from the literature (involving between 100 and 1001 cities) to optimality within an hour of CPU time. Furthermore, the proposed approach is demonstrated to outperform any of the most effective state-of-the-art exact algorithms available in the literature when applied to solve the given ATSP instances via their equivalently transformed symmetric TSP representations. For the mATSP, the proposed approach is able to solve 27 out of 36 instances derived from the ATSP library involving up to 1001 cities to optimality within an hour of CPU time and also outperforms the direct solution by CPLEX, one of the three most effective formulations reported in the literature for this class of problems. The proposed approach is easy to implement and can be used to solve ATSP and mATSP as stand-alone models or can be applied in contexts where they appear as sub-models within some application settings.

Suggested Citation

  • Maichel M. Aguayo & Subhash C. Sarin & Hanif D. Sherali, 2018. "Solving the single and multiple asymmetric Traveling Salesmen Problems by generating subtour elimination constraints from integer solutions," IISE Transactions, Taylor & Francis Journals, vol. 50(1), pages 45-53, January.
    • Handle: RePEc:taf:uiiexx:v:50:y:2018:i:1:p:45-53
    DOI: 10.1080/24725854.2017.1374580
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2017.1374580
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/24725854.2017.1374580?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. 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.
    2. Aguayo, Maichel M. & Fierro, Pablo E. & De la Fuente, Rodrigo A. & Sepúlveda, Ignacio A. & Figueroa, Dante M., 2021. "A mixed-integer programming methodology to design tidal current farms integrating both cost and benefits: A case study in the Chacao Channel, Chile," Applied Energy, Elsevier, vol. 294(C).
    3. Cui, Weiwei & Yang, Yiran & Di, Lei, 2023. "Modeling and optimization for static-dynamic routing of a vehicle with additive manufacturing equipment," International Journal of Production Economics, Elsevier, vol. 257(C).
    4. AERTS, Babiche & CORNELISSENS, Trijntje & SÖRENSEN, Kenneth, 2022. "The internal warehouse replenishment problem: the importance of storage and replenishment policies," Working Papers 2022007, University of Antwerp, Faculty of Business and Economics.

    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:taf:uiiexx:v:50:y:2018:i:1:p:45-53. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.