Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network
From MaRDI portal
Publication:2129372
Recommendations
- scientific article; zbMATH DE number 5812726
- Bus-based park-and-ride system: a stochastic model on multimodal network with congestion pricing schemes
- Park and ride for the day period and morning-evening commute
- Transit Service and Path Choice Models in Stochastic and Time-Dependent Networks
- Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
Cites work
- scientific article; zbMATH DE number 1300391 (Why is no real title available?)
- A note on detecting unbounded instances of the online shortest path problem
- A note on the stochastic shortest-route problem
- A polynomial-time algorithm to find shortest paths with recourse
- Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
- Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
- Dynamic programming and optimal control. Vol. 2
- Equilibrium traffic assignment for large scale transit networks
- Least expected time paths in stochastic, time-varying transportation networks
- Multicriteria stochastic shortest path problem for electric vehicles
- Network flows. Theory, algorithms, and applications.
- On the online shortest path problem with limited arc cost dependencies
- Optimal information location for adaptive routing
- Optimal paths in probabilistic networks: A case with temporary preferences
- Stochastic shortest path problems with recourse
- Stochastic shortest paths with recourse
- Trip-based path algorithms using the transit network hierarchy
- User equilibrium with recourse
Cited in
(2)
This page was built for publication: Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129372)