IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v350y2025i1d10.1007_s10479-022-04668-6.html
   My bibliography  Save this article

Anticipatory scheduling of synchromodal transport using approximate dynamic programming

Author

Listed:
  • Arturo E. Pérez Rivera

    (University of Twente)

  • Martijn R. K. Mes

    (University of Twente)

Abstract

We study the problem of scheduling container transport in synchromodal networks considering stochastic demand. In synchromodal networks, the transportation modes can be selected dynamically given the actual circumstances and performance is measured over the entire network and over time. We model this problem as a Markov Decision Process and propose a heuristic solution based on Approximate Dynamic Programming (ADP). Due to the multi-period nature of the problem, the one-step look-ahead perspective of the traditional approximate value-iteration approach can make the heuristic flounder and end in a local-optimum. To tackle this, we study the inclusion of Bayesian exploration using the Value of Perfect Information (VPI). In a series of numerical experiments, we show how VPI significantly improves a traditional ADP algorithm. Furthermore, we show how our proposed ADP–VPI combination achieves significant gains over common practice heuristics.

Suggested Citation

  • Arturo E. Pérez Rivera & Martijn R. K. Mes, 2025. "Anticipatory scheduling of synchromodal transport using approximate dynamic programming," Annals of Operations Research, Springer, vol. 350(1), pages 95-129, July.
    • Handle: RePEc:spr:annopr:v:350:y:2025:i:1:d:10.1007_s10479-022-04668-6
    DOI: 10.1007/s10479-022-04668-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-04668-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-022-04668-6?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.

    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:spr:annopr:v:350:y:2025:i:1:d:10.1007_s10479-022-04668-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.