Cost Function Approximation for the Dynamic Scheduled Service Network Design Problem

References

• Al-Kanj L, Nascimento J, Powell WB (2020) Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles. Eur. J. Oper. Res. 284(3):1088–1106.Crossref, Google Scholar
• Bai R, Wallace SW, Li J, Chong AYL (2014) Stochastic service network design with rerouting. Transportation Res. Part B Methodological 60:50–65.Crossref, Google Scholar
• Baubaid A, Boland N, Savelsbergh M (2023) The dynamic freight routing problem for less-than-truckload carriers. Transportation Sci. 57(3):717–740.Link, Google Scholar
• Belieres S, Hewitt M (2024) Hedging against uncertainty in transportation network design through flexible scheduling. Omega 126:103045.Crossref, Google Scholar
• Boland N, Hewitt M, Marshall L, Savelsbergh M (2017) The continuous-time service network design problem. Oper. Res. 65(5):1303–1321.Link, Google Scholar
• Boland N, Hewitt M, Marshall L, Savelsbergh M (2019) The price of discretizing time: A study in service network design. Eur. J. Transportation Logist. 8(2):195–216.Crossref, Google Scholar
• Chouman M, Crainic TG (2015) Cutting-plane matheuristic for service network design with design-balanced requirements. Transportation Sci. 49(1):99–113.Link, Google Scholar
• Crainic TG (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.Crossref, Google Scholar
• Crainic TG, Hewitt M (2021) Service network design. Crainic TG, Gendreau M, Gendron B, eds. Network Design with Applications to Transportation and Logistics (Springer, Cham, Switzerland), 347–382.Crossref, Google Scholar
• Crainic TG, Hewitt M, Toulouse M, Vu DM (2014) Service network design with resource constraints. Transportation Sci. 50(4):1380–1393.Link, Google Scholar
• Crainic TG, Hewitt M, Toulouse M, Vu DM (2018) Scheduled service network design with resource acquisition and management. Eur. J. Transportation Logist. 7(3):277–309.Crossref, Google Scholar
• Demir E, Burgholzer W, Hrušovskỳ M, Arıkan E, Jammernegg W, Van Woensel T (2016) A green intermodal service network design problem with travel time uncertainty. Transportation Res. Part B Methodological 93:789–807.Crossref, Google Scholar
• Erera A, Hewitt M, Savelsbergh M, Zhang Y (2013) Improved load plan design through integer programming based local search. Transportation Sci. 47(3):412–427.Link, Google Scholar
• Ghiani G, Manni A, Manni E (2022) A scalable anticipatory policy for the dynamic pickup and delivery problem. Comput. Oper. Res. 147:105943.Crossref, Google Scholar
• Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Systems Sci. Cybernetics 4(2):100–107.Crossref, Google Scholar
• Hewitt M (2022) The flexible scheduled service network design problem. Transportation Sci. 56(4):1000–1021.Link, Google Scholar
• Hewitt M, Lehuédé F (2023) New formulations for the scheduled service network design problem. Transportation Res. Part B Methodological 172:117–133.Crossref, Google Scholar
• Hewitt M, Rei W, Wallace SW (2021) Stochastic network design. Crainic TG, Gendreau M, Gendron B, eds. Network Design with Applications to Transportation and Logistics (Springer, Cham, Switzerland), 283–315.Crossref, Google Scholar
• Hewitt M, Crainic TG, Nowak M, Rei W (2019) Scheduled service network design with resource acquisition and management under uncertainty. Transportation Res. Part B Methodological 128:324–343.Crossref, Google Scholar
• Hildebrandt FD, Thomas BW, Ulmer MW (2023) Opportunities for reinforcement learning in stochastic dynamic vehicle routing. Comput. Oper. Res. 150:106071.Crossref, Google Scholar
• Hoff A, Lium AG, Løkketangen A, Crainic TG (2010) A metaheuristic for stochastic service network design. J. Heuristics 16:653–679.Crossref, Google Scholar
• Jarrah AI, Johnson E, Neubert LC (2009) Large-scale, less-than-truckload service network design. Oper. Res. 57(3):609–625.Link, Google Scholar
• Jiang X, Bai R, Ren J, Li J, Kendall G (2022) Lagrange dual bound computation for stochastic service network design. Eur. J. Oper. Res. 302(3):1097–1112.Crossref, Google Scholar
• Jiang X, Bai R, Wallace SW, Kendall G, Landa-Silva D (2021) Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design. Comput. Oper. Res. 128:105182.Crossref, Google Scholar
• Lanza G, Crainic TG, Passacantando M, Scutellà MG (2023) A continuous time physical graph based formulation to scheduled service network design. Bruglieri M, Festa P, Macrina G, Pisacane O, eds. Optim. Green Sustainability Ecological Transition. ODS 2023, AIRO Springer Series, vol. 12 (Springer, Cham, Switzerland), 265–275.Google Scholar
• Lanza G, Crainic TG, Rei W, Ricciardi N (2021) Scheduled service network design with quality targets and stochastic travel times. Eur. J. Oper. Res. 288(1):30–46.Crossref, Google Scholar
• Liu C, Lin S, Shen ZJM, Zhang J (2023) Stochastic service network design: The value of fixed routes. Transportation Res. Part E Logist. Transportation Rev. 174:103118.Crossref, Google Scholar
• Lium AG, Crainic TG, Wallace SW (2007) Correlations in stochastic programming: A case from stochastic service network design. Asia-Pacific J. Oper. Res. 24(2):161–179.Crossref, Google Scholar
• Lium AG, Crainic TG, Wallace SW (2009) A study of demand stochasticity in service network design. Transportation Sci. 43(2):144–157.Link, Google Scholar
• Marshall L, Boland N, Savelsbergh M, Hewitt M (2021) Interval-based dynamic discretization discovery for solving the continuous-time service network design problem. Transportation Sci. 55(1):29–51.Link, Google Scholar
• Pedersen MB, Crainic TG, Madsen OB (2009) Models and tabu search metaheuristics for service network design with asset-balance requirements. Transportation Sci. 43(2):158–177.Link, Google Scholar
• Powell WB (2021) Reinforcement Learning and Stochastic Optimization: A Unified Framework for Sequential Decisions (John Wiley & Sons, Inc., Hoboken, NJ).Google Scholar
• Scherr YO, Hewitt M, Mattfeld DC (2022) Stochastic service network design for a platooning service provider. Transportation Res. Part C Emerging Tech. 144:103912.Crossref, Google Scholar
• Scherr YO, Saavedra BAN, Hewitt M, Mattfeld DC (2019) Service network design with mixed autonomous fleets. Transportation Res. Part E Logist. Transportation Rev. 124:40–55.Crossref, Google Scholar
• Schulz JD (2025) Top 50 trucking companies. Retrieved September 11, https://www.logisticsmgmt.com/article/top_50_trucking_companies.Google Scholar
• Shu S, Xu Z, Baldacci R (2024) Incorporating holding costs in continuous-time service network design: New model, relaxation, and exact algorithm. Transportation Sci. 58(2):412–433.Link, Google Scholar
• Soeffker N, Ulmer MW, Mattfeld DC (2022) Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review. Eur. J. Oper. Res. 298(3):801–820.Crossref, Google Scholar
• Stein J, Hildebrandt FD, Ulmer MW, Thomas BW (2025) Learning state-dependent policy parametrizations for dynamic technician routing with rework. Transportation Sci. 59(5):1153–1171.Link, Google Scholar
• Stoia S, Laganà D, Ohlmann JW (2025) Dynamic pickup-and-delivery for collaborative platforms with time-dependent travel and crowdshipping. Eur. J. Oper. Res. 322(1):70–84.Crossref, Google Scholar
• Tirado G, Hvattum LM (2017a) Determining departure times in dynamic and stochastic maritime routing and scheduling problems. Flexible Services Manufacturing J. 29(3):553–571.Crossref, Google Scholar
• Tirado G, Hvattum LM (2017b) Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search. Ann. Oper. Res. 253(2):825–843.Crossref, Google Scholar
• Tirado G, Hvattum LM, Fagerholt K, Cordeau JF (2013) Heuristics for dynamic and stochastic routing in industrial shipping. Comput. Oper. Res. 40(1):253–263.Crossref, Google Scholar
• Ulmer MW, Goodson JC, Mattfeld DC, Thomas BW (2020a) On modeling stochastic dynamic vehicle routing problems. Eur. J. Transportation Logist. 9(2):100008.Crossref, Google Scholar
• Ulmer MW, Nowak M, Mattfeld DC, Kaminski B (2020b) Binary driver-customer familiarity in service routing. Eur. J. Oper. Res. 286(2):477–493.Crossref, Google Scholar
• Ulmer MW, Thomas BW, Campbell AM, Woyak N (2021) The restaurant meal delivery problem: Dynamic pickup and delivery with deadlines and random ready times. Transportation Sci. 55(1):75–100.Link, Google Scholar
• Wang X, Wallace SW (2016) Stochastic scheduled service network design in the presence of a spot market for excess capacity. Eur. J. Transportation Logist. 5(4):393–413.Crossref, Google Scholar
• Wang X, Crainic TG, Wallace SW (2019) Stochastic network design for planning scheduled transportation services: The value of deterministic solutions. INFORMS J. Comput. 31(1):153–170.Link, Google Scholar
• Wieberneit N (2008) Service network design for freight transportation: A review. OR Spectrum 30(1):77–112.Crossref, Google Scholar