Dynamic journeying under uncertainty

DOI10.1016/J.EJOR.2012.10.027MaRDI QIDQ2253524zbMATH OpenOpenAlexFDO

Authors Lauri Häme, Harri Hakula

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

zbMATH Keywords

stochastic processestransportationMarkov decision processesstochastic shortest path problemitinerary planning problem

Mathematics Subject Classification ID

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)

Recommendations

• Computing Multi-Modal Journey Plans under Uncertainty
• Arrival time dependent routing policies in public transport
• scientific article; zbMATH DE number 7071803
• The route problem of multimodal transportation with timetable under uncertainty: multi-objective robust optimization model and heuristic approach
• Arriving on time

Cites work

• scientific article; zbMATH DE number 3128787 (Why is no real title available?)
• scientific article; zbMATH DE number 1300391 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1095138 (Why is no real title available?)
• scientific article; zbMATH DE number 1445281 (Why is no real title available?)
• A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
• A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
• A Priori Optimization
• A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
• Algorithms for time-dependent bicriteria shortest path problems
• An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
• Arc Reduction and Path Preference in Stochastic Acyclic Networks
• Arriving on time
• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
• Dynamic routing for priority shipments in LTL service networks
• Dynamic shortest path in stochastic dynamic networks: Ship routing problem
• Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
• Finding the shortest path in stochastic networks
• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• Improved results for route planning in stochastic transportation networks
• Least expected time paths in stochastic, time-varying transportation networks
• On the online shortest path problem with limited arc cost dependencies
• Optimal paths in graphs with stochastic or multidimensional weights
• Optimal paths in probabilistic networks: A case with temporary preferences
• Robust path choice in networks with failures
• Shortest path problems with node failures
• Shortest paths in stochastic networks with correlated link costs
• Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
• Stochastic Shortest Paths Via Quasi-convex Maximization
• Stochastic shortest path problems with recourse
• Technical Note—A Note on the Stochastic Shortest Route Problem
• The Stochastic Shortest Route Problem
• The dynamic shortest path problem with anticipation
• The shortest route through a network with time-dependent internodal transit times
• Time dependency in multiple objective dynamic programming
• Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
• Time-varying shortest path problems with constraints
• Uncovering the Distribution of Motorists' Preferences for Travel Time and Reliability
• Vehicle routing with soft time windows and Erlang travel times

Cited in

(12)

• Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings
• Computing Multi-Modal Journey Plans under Uncertainty
• Arriving on time
• scientific article; zbMATH DE number 1445281 (Why is no real title available?)
• Reliability in public transit networks considering backup itineraries
• Itinerary planning with time budget for risk-averse travelers
• Routing optimization under uncertainty
• Robust routing in urban public transportation: how to find reliable journeys based on past observations
• The travelers route choice problem under uncertainty: dominance relations between strategies
• Maximizing the probability of arriving on time
• Uncertainty in the traveler's dilemma
• The covering Canadian traveller problem

This page was built for publication: Dynamic journeying under uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253524)