Abstract
Service Network Design (SND) problems arise when consolidation carriers plan vehicle or vessel capacities for their transportation networks for an upcoming operating season. The two-stage stochastic SND (SSND) further explicitly considers uncertain demand: carriers commit to offering transportation services in advance (first stage) and may later adapt by procuring additional costlier spot-market capacity (second stage). While more realistic, SSNDs are computationally challenging. In this work, we study the efficacy of using artificial neural networks to assist in solving two-stage SSND problems. The aim is to learn a predictive model that estimates the recourse cost of candidate first-stage SSND solutions under uncertain demand. This trained predictive model can then be used in lieu of the recourse subproblem, with the goal of forming a more tractable hybrid or surrogate optimization model. Results show that effective learning can be achieved: the solutions produced by the surrogate model exhibit an average estimation gap of about 4% between their true expected cost and their surrogate-predicted value. We also observe that estimation quality decreases as instance size increases (for a fixed training set size).
| Original language | English |
|---|---|
| Pages (from-to) | 79-86 |
| Number of pages | 8 |
| Journal | Transportation Research Procedia |
| Volume | 97 |
| DOIs | |
| State | Published - 2026 |
| Event | 13th International Conference on Transport Survey Methods, 2026 - Danang, Viet Nam Duration: 30 Mar 2025 → 4 Apr 2025 |
Bibliographical note
Publisher Copyright:Copyright © 2026. Published by Elsevier B.V.
Keywords
- freight transportation
- machine learning
- service network design
- two-stage stochastic programming
ASJC Scopus subject areas
- Transportation
Fingerprint
Dive into the research topics of 'Learning-Assisted Optimization for the Stochastic Service Network Design Problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver