Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
DOI10.1007/s11067-017-9345-2zbMath1390.90079OpenAlexW2607843552MaRDI QIDQ1642944
Karthik K. Srinivasan, A. Arun Prakash
Publication date: 18 June 2018
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-017-9345-2
Hypergraphs (05C65) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- Optimal path problems with second-order stochastic dominance constraints
- Finding reliable shortest paths in road networks under uncertainty
- Effects of countdown displays in public transport route choice under severe overcrowding
- Optimal routing for maximizing the travel time reliability
- A directed hypergraph model for random time dependent shortest paths
- Finding the \(K\) shortest hyperpaths
- Directed hypergraphs and applications
- Finding efficient and environmentally friendly paths for risk-averse freight carriers
- Ranking paths in stochastic time-dependent networks
- Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
- Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
- A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
- Stochastic shortest path problems with recourse
- Finding the K Shortest Loopless Paths in a Network
This page was built for publication: Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
