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

Scenario Predict-then-Optimize for Data-Driven Online Inventory Routing

Author

Listed:
  • Menglei Jia

    (Department of Management Science, Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200030, China)

  • Albert H. Schrotenboer

    (Operations, Planning, Accounting and Control Group, Department of Industrial Engineering & Innovation Sciences, Eindhoven University of Technology, 5612 AZ Eindhoven, Netherlands)

  • Feng Chen

    (Sino-US Global Logistics Institute, Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200030, China)

Abstract

The real-time joint optimization of inventory replenishment and vehicle routing is essential for cost-efficiently operating one-warehouse, multiple-retailer systems. This is complex because future demand predictions should capture (auto)correlation and lumpy retailer demand, and based upon such predictions, inventory replenishment and vehicle-routing decisions must be taken. Traditionally, such decisions are made by either making distributional assumptions or using machine-learning-based point forecasts. The former approach ignores nonstationary demand patterns, whereas the latter approach provides only a point forecast ignoring the inherent forecast error. Consequently, in practice, service levels often do not meet their targets, and truck fill rates fall short, harming the efficiency and sustainability of daily operations. We propose Scenario Predict-then-Optimize. This fully data-driven approach for online inventory routing consists of two subsequent steps at each real-time decision epoch. The scenario-predict step exploits neural networks—specifically multi-horizon quantile recurrent neural networks—to predict future demand quantiles, upon which we design a scenario sampling approach. The subsequent scenario-optimize step then solves a scenario-based two-stage stochastic programming approximation. Results show that our approach outperforms a classic sequential learning and (stochastic) optimization approach, distributional approaches, empirical sampling methods, residuals-based sample average approximation, and a state-of-the-art integrated learning and (stochastic) optimization approach. We show this on both synthetic data and large-scale real-life data from our industry partner. Our approach is appealing to practitioners. It is fast, does not rely on any distributional assumption, and does not face the burden of single-scenario forecasts. It also outperforms residuals-based scenario generation techniques. We show that it is robust for various demand and cost parameters, enhancing the efficiency and sustainability of daily inventory replenishment and truck-routing decisions. Finally, scenario Predict-then-Optimize is general and can be easily extended to account for other operational constraints, making it a useful tool in practice.

Suggested Citation

  • Menglei Jia & Albert H. Schrotenboer & Feng Chen, 2025. "Scenario Predict-then-Optimize for Data-Driven Online Inventory Routing," Transportation Science, INFORMS, vol. 59(5), pages 1032-1056, September.
  • Handle: RePEc:inm:ortrsc:v:59:y:2025:i:5:p:1032-1056
    DOI: 10.1287/trsc.2024.0613
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2024.0613
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2024.0613?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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:inm:ortrsc:v:59:y:2025:i:5:p:1032-1056. 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.