Best-path planning for public transportation systems
暂无分享,去创建一个
[1] Michael P. Wellman,et al. Using stochastic-dominance relationships for bounding travel times in stochastic networks , 1999, Proceedings 199 IEEE/IEEJ/JSAI International Conference on Intelligent Transportation Systems (Cat. No.99TH8383).
[2] Michael P. Wellman,et al. Path Planning under Time-Dependent Uncertainty , 1995, UAI.
[3] J.L. Bander,et al. A new route optimization algorithm for rapid decision support , 1991, Vehicle Navigation and Information Systems Conference, 1991.
[4] Kyriacos C. Mouskos,et al. A STRATEGY FOR SOLVING STATIC MULTIPLE-OPTIMAL-PATH TRANSIT NETWORK PROBLEMS , 1996 .
[5] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[6] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[7] 劉昭麟. IRIS: integrated route information service for multimodal public transportation systems , 2001 .
[8] N. Nilsson. STUART RUSSELL AND PETER NORVIG, ARTIFICIAL INTELLIGENCE: A MODERN APPROACH , 1996 .
[9] Randolph W. Hall,et al. The Fastest Path through a Network with Random Time-Dependent Travel Times , 1986, Transp. Sci..
[10] Chao-Lin Liu,et al. Path-planning algorithms for public transportation systems , 2001, ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585).
[11] Robert L. Smith,et al. Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..
[12] Robert B Dial,et al. TRANSIT PATHFINDER ALGORITHM , 1967 .
[13] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[14] Elke A. Rundensteiner,et al. Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation , 1998, IEEE Trans. Knowl. Data Eng..