Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings

DOI10.1016/j.ejor.2021.07.042zbMath1495.90229OpenAlexW3188898003WikidataQ114184434 ScholiaQ114184434MaRDI QIDQ2670574

Bernard G. Zweers, Robert D. van der Mei

Publication date: 11 March 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.07.042

zbMATH Keywords

certainty equivalentlogisticsstochastic shortest pathintermodal transportoverbookings

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)

Cites Work

• Optimal path problems with second-order stochastic dominance constraints
• Methods of applied mathematics with a software overview
• On an exact method for the constrained shortest path problem
• Maximum probability shortest path problem
• An integer programming approach for linear programs with probabilistic constraints
• Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
• Extended dominance and a stochastic shortest path problem
• Opportunities for OR in intermodal freight transport research: A review.
• An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
• A box decomposition algorithm to compute the hypervolume indicator
• Improved quick hypervolume algorithm
• Itinerary planning with time budget for risk-averse travelers
• A second-order cone programming approach for linear programs with joint probabilistic constraints
• Dynamic journeying under uncertainty
• Algorithms for non-linear and stochastic resource constrained shortest path
• Dynamic fleet management. Concepts, systems, algorithms \& case studies
• Best routes selection in international intermodal networks
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• Routing Optimization Under Uncertainty
• A survey of resource constrained shortest path problems: Exact solution approaches
• Additive Consistency of Risk Measures and Its Application to Risk-Averse Routing in Networks
• Introduction to Stochastic Programming
• The problem of calculating the volume of a polyhedron is enumerably hard
• Approximate Dynamic Programming
• Multicriteria Optimization

This page was built for publication: Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings