An algorithm for finding reasonable paths in transit networks

Journal of Advanced Transportation

Volumn 41, Issue 3, 2007, Pages 285-305

  Tan, Man Chun ^a   Tong, C O ^b   Wong, S C ^b   Xu, Jian Min ^c  

^a JINAN UNIVERSITY   (China)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Path finding algorithm; Reasonable path; Transit network; Trip planning

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; DECISION MAKING; MOTION PLANNING; SOFTWARE PROTOTYPING;

PATH-FINDING ALGORITHM; REASONABLE PATHS; TRANSIT NETWORKS; TRIP PLANNING;

RAPID TRANSIT;

EID: 34548806073     PISSN: 01976729     EISSN: None     Source Type: Journal    
DOI: 10.1002/atr.5670410305     Document Type: Article

References (55)

1. Adler, J. L. (2001) Investigating the learning effects of route guidance and traffic advisories on route choice behavior. Transportation Research Part C, 9 (4), 1-14.
2. Andreasson, I. (1977) A method for the analysis of transit networks. In M. Roubens (ed.) Advances in Operations Research, North-Holland Publishing Company, Amsterdam.
3. Boulmakoul, A. (2004) Generalized path-finding algorithms on semirings and the fuzzy shortest path problem. Journal of Computational and Applied Mathematic, 162 (1), 263-272.
4. Cepeda, M., Cominetti, R. and Florian, M. (2006) A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria, Transportation Research Part B, 40, 437-459.
5. Chen, Y.-L. and Yang, H.-H. (2004) Finding the first K shortest paths in a time-window network. Computers and Operations Research, 31 (4), 499-513.
6. Cheung, W.M., Wong, S.C. and Tong, C.O. (2006) Estimation of a time-dependent origin-destination matrix for congested highway networks. Journal of Advanced Transportation, 40, 95-117.
7. Chuang, T.-N. and Kung, J.-Y. (2005) The fuzzy shortest path length and the corresponding shortest path in a network. Computers and Operations Research, 32 (6), 1409-1428.
8. Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C. (2001) Introduction to Algorithms, MIT Press, Cambridge, MA.
9. Davies, C. and Lingras, P. (2003) Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks. European Journal of Operational Research, 144 (1), 27-38.
10. Desaulniers, G. and Villeaneuve, D. (2000) The shortest path problem with time windows and linear waiting costs. Transportation Science, 34, 312-319.
11. Dial, R.B. (1967) Transit pathfinder algorithms. Highway Research Record, 205, 67-85.
12. Dijkstra, E.W. (1959) A note on two problems in connection with graphs. Numeriche Mathematik, 1, 269-271.
13. Do, M., Ryu, S. and Lee, S. (2006) Drivers' route choice and learning mechanism under bounded information environment. Journal of Advanced Transportation, 40 (2), 165-183.
14. Fung, S.W.C., Tong, C.O. and Wong, S.C (2005) Validation of a conventional metro network model using real data. Journal of Intelligent Transportation Systems, 9, 69-79.
15. Gentile, G., Nguyen, S. and Pallottino, S. (2005) Route choice on transit networks with online information at stops, Transportation Science, 39 (3), 289-297.
16. Granat, J. and Guerriero, F. (2003) The interactive analysis of the multicriteria shortest path problem by the reference point method. European Journal of Operational Research, 151 (1), 103-118.
17. Hall, R. W. (1996) Route choice and advance traveler information systems on a capacitated and dynamic network. Transportation Research Part C, 4, 289-306.
18. Han, Y.-J. (2004) Improved algorithm for all pairs shortest paths. Information Processing Letters, 91 (5), 245-250.
19. Hoogendoorn, S. P. and Bovy, P.H.L. (2004) Pedestrian route-choice and activity scheduling theory and models. Transportation Research Part B, 38 (2), 169-190.
20. Keller, G. and Warrack, B. (2000) Statistics for Management and Economics, Duxbury Press, Pacific Grove.
21. Lam, W.H.K., Cheung, C.Y. and Poon, Y.F. (1999) A study of passenger discomfort measures at Hong Kong Mass transit railway system, Journal of Advanced Transportation, 33 (3), 389-399.
22. Le Clercq, F. (1972) A public transport assignment model. Traffic Engineering and Control, 14, 91-96.
23. Lin, W.H. and Bertini, R.L. (2004) Modeling schedule recovery processes in transit operations for bus arrival time prediction. Journal of Advanced Transportation, 38, 347-365.
24. Lo, H.K., Yip, C.-W. and Wan, Q.K. (2004) Modeling competitive multi-modal transit services: a nested logit approach. Transportation Research Part C, 12 (3), 251-272.
25. Lozano, A. and Storchi, G. (2002) Shortest viable hyperpath in multimodal networks, Transportation Research Part B, 36, 853-874.
26. McCormack, J.E. and Roberts, S.A. (1998) Exploiting object oriented methods for multi-modal trip planning systems. Information and Software Technology, 38 (6), 409-417.
27. Morikawa, T. and Miwa, T. (2006) Preliminary analysis on dynamic route choice behavior: using probe-vehicle data. Journal of Advanced Transportation, 40 (2), 141-163.
28. Nguyen, S. and Pallotino, S. (1988) Equilibrium traffic assignment in large scale transit networks. European Journal of Operational Research 37 (2), 176-186.
29. Okada, S. (2004) Fuzzy shortest path problems incorporating interactivity among paths. Fuzzy Sets and Systems, 142 (3), 335-357.
30. Pallottino, S. and Scutell, M.G. (2003) A new algorithm for reoptimizing shortest paths when the arc costs change. Operations Research Letters, 31 (2), 149-160.
31. Peng, Z.R. and Huang, R.H. (2000) Design and development of interactive planning for web-based transit information systems. Transportation Research Part C, 8, 409-425.
32. Pettie, S. (2004) A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science, 312 (1), 47-74.
33. Poon, M.H., Tong, C.O. and Wong, S.C. (2003) Validation of a schedule-based capacity restraint transit assignment model for a large-scale network. Journal of Advanced Transportation, 38, 5-26.
34. Poon, M.H., Tong, C.O. and Wong, S.C. (2004) A dynamic schedule-based model for congested transit networks. Transportation Research Part B, 38, 343-368.
35. Spiess, H. and Florian, M. (1989) Optimal strategies: a new assignment model for transit networks. Transportation Research Part B, 23 (2), 83-102.
36. Sun, A. and Hickman, M. (2004) Scheduling considerations for a branching transit route. Journal of Advanced Transportation, 38, 243-290.
37. Szeto, W.Y. and Lo, H.K. (2005) Strategies for road network design over time: robustness under uncertainty. Transportmetrica, 1(1), 47-63.
38. Szeto, W.Y. and Lo, H.K. (2006) Dynamic traffic assignment: properties and extensions. Transportmetrica, 2 (1), 31-52.
39. Tong, C.O. and Richardson, A.J. (1984) A computer model for finding the time-dependent minimum path in a transit system with fixed schedules. Journal of Advanced Transportation, 18, 145-161.
40. Tong, C.O., Tan, M.C. and Wong, S.C. (2001) A decision support system for transit service planning. In: H.P. Lo and A. Zhang (eds) Proceedings of the Sixth Conference of Hong Kong Society for Transportations Studies, Hong Kong, pp. 337-346.
41. Tong, C.O. and Wong, S.C. (1999a) A schedule-based dynamic trip assignment model for transit networks. Journal of Advanced Transportation, 33, 371-388.
42. Tong, C.O., and Wong, S.C. (1999b) A stochastic transit assignment model using a dynamic schedule-based network. Transportation Research Part B, 33 (2), 107-121.
43. Tong, C.O. and Wong, S.C. (2000) A predictive dynamic traffic assignment model in congested capacity-constrained road networks. Transportation Research Part B, 34, 625-644.
44. Tong, C.O., Wong, S.C., Poon, M.H. and Tan, M.C. (2001) A schedule-based dynamic transit network model - recent advances and prospective future research. Journal of Advanced Transportation, 35, 175-195.
45. Tremblay, N. and Florian, M. (2001) Temporal shortest paths: parallel computing implementations. Parallel Computing, 27, 1569-1609.
46. Van der Zijpp, N.J. and Fiorenzo, C.S. (2005) Path enumeration by finding the constrained K-shortest paths. Transportation Research Part B, 39 (6), 545-563.
47. Van Nes, R. and Bovy, P.H.L. (2004) Multimodal traveling and its impact on urban transit network design. Journal of Advanced Transportation, 38, 225-241.
48. Weiss, M.A. (1995) Data structures and algorithms analysis. Addison Wesley Longman, Menlo Park, California.
49. Wong, K.I., Wong, S.C., Tong, C.O., Lam, W.H.K., Lo, H.K., Yang, H. and Lo, H.P. (2005) Estimation of origin-destination matrices for a multimodal public transit network. Journal of Advanced Transportation, 39, 139-168.
50. Wong, S.C. and Tong, C.O. (1998) Estimation of time-dependent origin-destination matrices for transit networks. Transportation Research Part B, 32, 35-48.
51. Wong, S.C., Yang, C. and Lo, H.K. (2001) A path-based traffic assignment algorithm based on the TRANSYT traffic model. Transportation Research Part B, 35 (2), 163-181.
52. Wu, J., Florian, M. and Marcotte, P. (1994) Transit equilibrium assignment: a model and solution algorithms. Transportation Science, 28 (3), 193-203.
53. Yang, H.-H. and Chen, Y.-L. (2005) Finding K shortest looping paths in a traffic-light network, Computers and Operations Research, 32 (3), 571-581.
54. Zhan, F.B. and Noon, C.E. (1998) Shortest path algorithms: an evaluation using real road networks. Transportation Science, 32, 65-73.
55. Ziliaskopoulos, A. and Wardell, W. (2000) An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays. European Journal of Operational Research, 125, 486-502.