Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014 (2014), Article ID 641562, 15 pages
http://dx.doi.org/10.1155/2014/641562
Research Article

High-Speed Rail Train Timetabling Problem: A Time-Space Network Based Method with an Improved Branch-and-Price Algorithm

School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China

Received 6 December 2013; Revised 12 February 2014; Accepted 24 February 2014; Published 30 April 2014

Academic Editor: Gongnan Xie

Copyright © 2014 Bisheng He 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. B. Richard, S. Andrew, and J. Ying, “2012. High-speed rail: the first three years taking the pulse of China's emerging program,” China Transport Topics 4, World Bank, Washington, DC, USA, 2012. View at Google Scholar
  2. H. Fu, L. Nie, B. R. Sperry, and Z. He, “Train stop scheduling in a high-speed rail network by utilizing a two-stage approach,” Mathematical Problems in Engineering, vol. 2012, Article ID 579130, 11 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. P. Serafini and W. Ukovich, “A mathematical model for periodic scheduling problems,” SIAM Journal on Discrete Mathematics, vol. 2, no. 4, pp. 550–581, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. R. M. P. Goverde, Punctuality of Railway Operations and Timetable Stability Analysis, TRAIL Research School, Delft, The Netherlands, 2005.
  5. L. Peeters, Cyclic Railway Timetable Optimization, Erasmus Universiteit Rotterdam, Rotterdam, The Netherlands, 2003.
  6. C. Liebchen and L. Peeters, “Integral cycle bases for cyclic timetabling,” Discrete Optimization, vol. 6, no. 1, pp. 98–109, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. L. Kroon, G. Maróti, M. R. Helmrich, M. Vromans, and R. Dekker, “Stochastic improvement of cyclic railway timetables,” Transportation Research B: Methodological, vol. 42, no. 6, pp. 553–570, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. T. Schlechte, Railway Track Allocation: Models and Algorithms, Technische University Berlin, Berlin, Germany, 2012.
  9. X. Cai and C. J. Goh, “A fast heuristic for the train scheduling problem,” Computers and Operations Research, vol. 21, no. 5, pp. 499–510, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. X. Cai, C. J. Goh, and A. I. Mees, “Greedy heuristics for rapid scheduling of trains on a single track,” IIE Transactions, vol. 30, no. 5, pp. 481–493, 1998. View at Publisher · View at Google Scholar · View at Scopus
  11. A. Higgins, E. Kozan, and L. Ferreira, “Heuristic techniques for single line train scheduling,” Journal of Heuristics, vol. 3, no. 1, pp. 43–62, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. A. Higgins, E. Kozan, and L. Ferreira, “Optimal scheduling of trains on a single line track,” Transportation Research B: Methodological, vol. 30, no. 2, pp. 147–158, 1996. View at Publisher · View at Google Scholar · View at Scopus
  13. Y. Lee and C.-Y. Chen, “A heuristic for the train pathing and timetabling problem,” Transportation Research B: Methodological, vol. 43, no. 8-9, pp. 837–851, 2009. View at Publisher · View at Google Scholar · View at Scopus
  14. R. L. Burdett and E. Kozan, “A sequencing approach for creating new train timetables,” OR Spectrum, vol. 32, no. 1, pp. 163–193, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. A. D'Ariano, D. Pacciarelli, and M. Pranzo, “A branch and bound algorithm for scheduling trains in a railway network,” European Journal of Operational Research, vol. 183, no. 2, pp. 643–657, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  16. U. Brännlund, P. O. Lindberg, A. Nõu, and J.-E. Nilsson, “Railway timetabling using Lagrangian relaxation,” Transportation Science, vol. 32, no. 4, pp. 358–369, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  17. A. Caprara, M. Fischetti, and P. Toth, “Modeling and solving the train timetabling problem,” Operations Research, vol. 50, no. 5, pp. 851–916, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  18. A. Caprara, M. Monaci, P. Toth, and P. L. Guida, “A Lagrangian heuristic algorithm for a real-world train timetabling problem,” Discrete Applied Mathematics, vol. 154, no. 5, pp. 738–753, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. V. Cacchiani, A. Caprara, and P. Toth, “A column generation approach to train timetabling on a corridor,” Journal of Operations Research, vol. 6, no. 2, pp. 125–142, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. X. Zhou and M. Zhong, “Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds,” Transportation Research B: Methodological, vol. 41, no. 3, pp. 320–341, 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. F. Li, Z. Gao, K. Li, and D. Z. Wang, “Train routing model and algorithm combined with train scheduling,” Journal of Transportation Engineering, vol. 139, no. 1, pp. 81–91, 2012. View at Google Scholar
  22. S. Harrod, “Modeling network transition constraints with hypergraphs,” Transportation Science, vol. 45, no. 1, pp. 81–97, 2011. View at Publisher · View at Google Scholar · View at Scopus
  23. R. Lusby, J. Larsen, D. Ryan, and M. Ehrgott, “Routing trains through railway junctions: a new set-packing approach,” Transportation Science, vol. 45, no. 2, pp. 228–245, 2011. View at Publisher · View at Google Scholar · View at Scopus
  24. C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance, “Branch-and-price: column generation for solving huge integer programs,” Operations Research, vol. 46, no. 3, pp. 316–329, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet