Dynamic journeying under uncertainty
From MaRDI portal
Publication:2253524
DOI10.1016/j.ejor.2012.10.027zbMath1292.90309OpenAlexW1989705264MaRDI QIDQ2253524
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.10.027
transportationMarkov decision processesstochastic processesstochastic shortest path problemitinerary planning problem
Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Markov and semi-Markov decision processes (90C40)
Related Items (5)
Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings ⋮ The covering Canadian traveller problem ⋮ Itinerary planning with time budget for risk-averse travelers ⋮ Routing Optimization Under Uncertainty ⋮ Reliability in public transit networks considering backup itineraries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The dynamic shortest path problem with anticipation
- Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
- Optimal paths in probabilistic networks: A case with temporary preferences
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- Time dependency in multiple objective dynamic programming
- Shortest paths in stochastic networks with correlated link costs
- Finding the shortest path in stochastic networks
- Algorithms for time-dependent bicriteria shortest path problems
- Arriving on time
- The shortest route through a network with time-dependent internodal transit times
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- Dynamic Routing for Priority Shipments in LTL Service Networks
- Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
- Optimal paths in graphs with stochastic or multidimensional weights
- Vehicle routing with soft time windows and Erlang travel times
- Technical Note—A Note on the Stochastic Shortest Route Problem
- A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
- The Stochastic Shortest Route Problem
- Shortest path problems with node failures
- Time-varying shortest path problems with constraints
- A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
- Robust path choice in networks with failures
- On the online shortest path problem with limited arc cost dependencies
- Stochastic shortest path problems with recourse
- Arc Reduction and Path Preference in Stochastic Acyclic Networks
- Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
- Uncovering the Distribution of Motorists' Preferences for Travel Time and Reliability
- Stochastic Shortest Paths Via Quasi-convex Maximization
- A Priori Optimization
This page was built for publication: Dynamic journeying under uncertainty
