Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 153949, 8 pages
http://dx.doi.org/10.1155/2014/153949
Research Article

Optimal Path Choice in Railway Passenger Travel Network Based on Residual Train Capacity

1School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
2State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, China

Received 17 January 2014; Revised 7 May 2014; Accepted 3 June 2014; Published 6 July 2014

Academic Editor: Dimitrios A. Karras

Copyright © 2014 Fei Dou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. F. Shi, Z. Zhou, J. Yao, and H. Huang, “Incorporating transfer reliability into equilibrium analysis of railway passenger flow,” European Journal of Operational Research, vol. 220, no. 2, pp. 378–385, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  2. C. O. Tong and A. J. Richardson, “A computer model for finding the time dependent minimum path in transit systems with fixed schedules,” Journal of Advanced Transportation, vol. 18, no. 2, pp. 145–161, 1984. View at Publisher · View at Google Scholar · View at Scopus
  3. C. O. Tong and S. C. Wong, “An algorithm for finding reasonable paths in transit networks,” Transportation Research B, vol. 33, pp. 107–121, 1999. View at Google Scholar
  4. C. O. Tong, S. C. Wong, M. H. Poon, and M. C. Tan, “A schedule-based dynamic transit network model—recent advances and prospective future research,” Journal of Advanced Transportation, vol. 35, no. 2, pp. 175–195, 2001. View at Publisher · View at Google Scholar · View at Scopus
  5. M. H. Poon, S. C. Wong, and C. O. Tong, “A stochastic transit assignment model using a dynamic schedule-based network,” Transportation Research B, vol. 38, pp. 343–368, 2004. View at Google Scholar
  6. A. Nuzzolo, F. Russo, and U. Crisalli, “A doubly dynamic schedule-based assignment model for transit networks,” Transportation Science, vol. 35, no. 3, pp. 268–285, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. R. H. Huang and Z. R. Peng, “Schedule-based path-finding algorithms for transit trip-planning systems,” Transportation Research Record, no. 1783, pp. 142–148, 2002. View at Google Scholar · View at Scopus
  8. R. Huang, “A schedule-based pathfinding algorithm for transit networks using pattern first search,” GeoInformatica, vol. 11, no. 2, pp. 269–285, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. N. Rochau, K. Nökel, and M. G. H. Bell, “Cost functions for strategies in schedule-based transit networks with limited vehicle capacities,” Transportation Research Record, no. 2284, pp. 62–69, 2012. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Nuzzolo, U. Crisalli, and L. Rosati, “A schedule-based assignment model with explicit capacity constraints for congested transit networks,” Transportation Research C: Emerging Technologies, vol. 20, no. 1, pp. 16–33, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. L. Fu, D. Sun, and L. R. Rilett, “Heuristic shortest path algorithms for transportation applications: state of the art,” Computers and Operations Research, vol. 33, no. 11, pp. 3324–3343, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. N. Katoh, T. Ibaraki, and H. Mine, “An efficient algorithm for K shortest simple paths,” Networks, vol. 12, no. 4, pp. 411–427, 1982. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. D. Eppstein, “Finding the k shortest paths,” SIAM Journal on Computing, vol. 28, no. 2, pp. 652–673, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. S. Zhang and X. Liu, “A new algorithm for finding the k shortest transport paths in dynamic stochastic networks,” Journal of Vibroengineering, vol. 15, no. 2, pp. 726–735, 2013. View at Google Scholar · View at Scopus
  15. P. Modesti and A. Sciomachen, “A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks,” European Journal of Operational Research, vol. 111, no. 3, pp. 495–508, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  16. N. Rieser-Schuessler, M. Balmer, and K. W. Axhausen, “Route choice sets for very high-resolution data,” Transportmetrica A-Transport Science, vol. 9, no. 9, pp. 825–845, 2013. View at Google Scholar
  17. E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. F. B. Zhan, “Three fastest shortest path algorithms on real road networks: data structures and procedures,” Journal of Geographic Information and Decision Analysis, vol. 1, no. 1, pp. 69–82, 1997. View at Google Scholar
  19. D. van Vliet, “Improved shortest path algorithms for transport networks,” Transportation Research, vol. 12, no. 1, pp. 7–20, 1978. View at Publisher · View at Google Scholar · View at Scopus
  20. A. Pradhan and G. Mahinthakumar, “Finding all-pairs shortest path for a large-scale transportation network using parallel Floyd-Warshall and parallel Dijkstra algorithms,” Journal of Computing in Civil Engineering, vol. 27, no. 3, pp. 263–273, 2013. View at Publisher · View at Google Scholar · View at Scopus
  21. G. Szűcs, “Route planning based on uncertain information in transport networks,” Transport, vol. 27, no. 1, pp. 79–85, 2012. View at Google Scholar
  22. S. Namkoong, J. H. Rho, and J. U. Choi, “Development of the tree-based link labeling algorithm for optimal path-finding in urban transportation networks,” Mathematical and Computer Modelling, vol. 27, no. 9–11, pp. 51–65, 1998. View at Publisher · View at Google Scholar · View at Scopus
  23. W. T. Xu, S. W. He, R. Song, and S. S. Chaudhry, “Finding the K shortest paths in a schedule-based transit network,” Computers and Operations Research, vol. 39, no. 8, pp. 1812–1826, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. D. Canca, A. Zarzo, P. L. González-R, E. Barrena, and E. Algaba, “A methodology for schedule-based paths recommendation in multimodal public transportation networks,” Journal of Advanced Transportation, vol. 47, no. 3, pp. 319–335, 2013. View at Publisher · View at Google Scholar · View at Scopus