Arrival time dependent routing policies in public transport
From MaRDI portal
Publication:1627847
DOI10.1016/j.dam.2018.05.031zbMath1407.90045OpenAlexW2809280859MaRDI QIDQ1627847
Jácint Szabó, Alpár Jüttner, Marco Laumanns, Kristóf Bérczi
Publication date: 3 December 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/86687/1/1-s2.0-S0166218X18302920-main.pdf
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Uses Software
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Optimal routing for maximizing the travel time reliability
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
- Arriving on time
- Polynomial-Time Approximation Schemes for Shortest Path with Alternatives
- Speedup Techniques for the Stochastic on-time Arrival Problem
- Optimal paths in graphs with stochastic or multidimensional weights
- On a routing problem
- A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
- Stochastic shortest path problems with recourse
- Shortest Paths in Probabilistic Graphs
This page was built for publication: Arrival time dependent routing policies in public transport