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

Branch and Price for the Stochastic Traveling Salesman Problem with Generalized Latency

Author

Listed:
  • Benedikt Lienkamp

    (School of Management, Technical University of Munich, 80333 Munich, Germany)

  • Mike Hewitt

    (Quinlan School of Business, Loyola University, Chicago, Illinois 60611)

  • Maximilian Schiffer

    (School of Management, Technical University of Munich, 80333 Munich, Germany; and Munich Data Science Institute, Technical University of Munich, 80333 Munich, Germany)

Abstract

We consider an extension of the symmetric traveling salesman problem with generalized latency that explicitly models uncertainty. The stochastic traveling salesman problem with generalized latency (STSP-GL) aims to choose a subset of nodes of an undirected graph and determines a Hamiltonian tour among those nodes, minimizing an objective function that is a weighted combination of route design and passenger routing costs. These nodes are selected to ensure that a predefined percentage of uncertain passenger demand is served with a given probability. We formulate the STSP-GL as a stochastic program and propose a branch-and-price algorithm for solving its deterministic equivalent. We also develop a local search approach with which we improve the performance of the branch-and-price approach. We assess the efficiency of the proposed methods on a set of instances from the literature. We demonstrate that the proposed methods outperform a known benchmark, improving upper bounds by up to 85% and lower bounds by up to 55%. Finally, we show that solutions of the stochastic model are both more cost-effective and robust than those of the deterministic model.

Suggested Citation

  • Benedikt Lienkamp & Mike Hewitt & Maximilian Schiffer, 2025. "Branch and Price for the Stochastic Traveling Salesman Problem with Generalized Latency," Transportation Science, INFORMS, vol. 59(2), pages 229-249, March.
    • Handle: RePEc:inm:ortrsc:v:59:y:2025:i:2:p:229-249
    DOI: 10.1287/trsc.2023.0417
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2023.0417
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2023.0417?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:ortrsc:v:59:y:2025:i:2:p:229-249. 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.