IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i5p734-746.html
   My bibliography  Save this article

Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions

Author

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

Abstract

In this paper, we present a single-commodity flow-based formulation for the high-multiplicity asymmetric traveling salesman problem (HMATSP), which is an extension of the asymmetric traveling salesman problem (ATSP) wherein a city can be visited multiple times. We show that even though this formulation is not as tight as the best known formulation for the HMATSP, it is faster and easier to use for direct solution by CPLEX and can be used to model several variants or extensions of the HMATSP that have not been studied in the literature. Furthermore, we propose effective accelerated Benders algorithms that are demonstrated to solve instances of the HMATSP and its extensions, which are derived from the well-known ATSP libraries and involve up to 1001 cities, within an hour of CPU time. These are the largest-sized HMATSP instances solved to optimality in the literature.

Suggested Citation

  • Maichel M. Aguayo & Subhash C. Sarin & Hanif D. Sherali, 2018. "Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(5), pages 734-746, May.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:5:p:734-746
    DOI: 10.1057/s41274-017-0261-0
    as

    Download full text from publisher

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

    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:tjorxx:v:69:y:2018:i:5:p:734-746. 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/tjor .

    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.