Finding Reliable Shortest Path in Stochastic Time-dependent Network
Authors:
- Yiyong PanYPYiyong Pan
- Lu SunLSLu Sun
- Minli GeMGMinli Ge
Open Access
- 1 November 2013
- journal article
- Published by Elsevier in Procedia - Social and Behavioral Sciences
- Vol. 96, 451-460
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Estimation of expected travel time using the method of momentCanadian Journal of Civil Engineering, 2011
- Data mining-based adaptive regression for developing equilibrium speed–density relationshipsCanadian Journal of Civil Engineering, 2010
- Shortest path problem considering on-time arrival probabilityTransportation Research Part B: Methodological, 2009
- Path finding under uncertaintyJournal of Advanced Transportation, 2005
- Adaptive routing considering delays due to signal operationsTransportation Research Part B: Methodological, 2004
- A polynomial‐time algorithm to find shortest paths with recourseNetworks, 2003
- On the online shortest path problem with limited arc cost dependenciesNetworks, 2002
- An adaptive routing algorithm for in-vehicle route guidance systems with real-time informationTransportation Research Part B: Methodological, 2001
- Expected shortest paths in dynamic and stochastic traffic networksTransportation Research Part B: Methodological, 1998
- Stochastic shortest paths with recourseNetworks, 1988