IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v36y2024i4p1064-1083.html
   My bibliography  Save this article

Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone

Author

Listed:
  • Marcos Blufstein

    (Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires C1428EGA, Argentina)

  • Gonzalo Lera-Romero

    (Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires C1428EGA, Argentina)

  • Francisco J. Soulignac

    (Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires C1428EGA, Argentina; Instituto de Investigación en Ciencias de la Computación (ICC), CONICET-Universidad de Buenos Aires, Buenos Aires C1428EGA, Argentina)

Abstract

Truck-and-drone routing problems have become an important research topic in the last decade because of their applications for last-mile deliveries. Despite the many publications in this area, the most efficient exact algorithms designed thus far struggle to solve the benchmark instances with 39 or more customers. This fact holds even for one of the simplest variants involving one truck and one drone whose routes must synchronize at customers’ locations: the basic traveling salesman problem with a drone (TSP-D). In this article, we devise a new algorithm for the TSP-D that solves every benchmark instance with up to 59 customers, and it scales up to 99 customers when the drone is much faster than the truck. The core of our method is a dynamic programming algorithm that is applied for column generation and variable fixing within tailored decremental state-space relaxation strategies.

Suggested Citation

  • Marcos Blufstein & Gonzalo Lera-Romero & Francisco J. Soulignac, 2024. "Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone," INFORMS Journal on Computing, INFORMS, vol. 36(4), pages 1064-1083, July.
    • Handle: RePEc:inm:orijoc:v:36:y:2024:i:4:p:1064-1083
    DOI: 10.1287/ijoc.2022.0390
    as

    Download full text from publisher

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

    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:orijoc:v:36:y:2024:i:4:p:1064-1083. 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.