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

A Branch and Bound Algorithm and Iterative Reordering Strategies for Inserting Additional Trains in Real Time: A Case Study in Germany

1Institute of Railway Systems Engineering and Traffic Safety, Technical University of Braunschweig, Pockelsstrasse 3, 38106 Braunschweig, Germany
2School of Transportation Engineering, Tongji University, 4800 Caoan Road, Shanghai 201804, China

Received 6 June 2014; Revised 1 September 2014; Accepted 2 September 2014

Academic Editor: Huimin Niu

Copyright © 2015 Yuyan Tan and Zhibin Jiang. 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. J. Pachl, “Control of railway operation on open access networks,” in Proceedings of the 7th International Congress on Advances in Civil Engineering, Istanbul, Turkey, October 2006.
  2. M. Xie and L. Nie, “Model of cyclic train timetable,” Journal of the China Railway Society, vol. 4, pp. 7–13, 2009. View at Google Scholar
  3. D. Yang, L. Nie, Y. Tan, Z. He, and Y. Zhang, “Working out an incomplete cyclic train timetable for high-speed railways by computer,” WIT Transactions on the Built Environment, vol. 114, pp. 899–999, 2010. View at Google Scholar
  4. F. Corman, A. D'Ariano, D. Pacciarelli, and M. Pranzo, “Centralized versus distributed systems to reschedule trains in two dispatching areas,” Public Transport, vol. 2, no. 3, pp. 219–247, 2010. View at Publisher · View at Google Scholar · View at Scopus
  5. A. D'Ariano, M. Pranzo, and I. A. Hansen, “Conflict resolution and train speed coordination for solving real-time timetable perturbations,” IEEE Transactions on Intelligent Transportation Systems, vol. 8, no. 2, pp. 208–222, 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. A. D'Ariano, F. Corman, D. Pacciarelli, and M. Pranzo, “Reordering and local rerouting strategies to manage train traffic in real time,” Transportation Science, vol. 42, no. 4, pp. 405–419, 2008. View at Publisher · View at Google Scholar · View at Scopus
  7. V. Cacchiani, A. Caprara, and P. Toth, “Non-cyclic train timetabling and comparability graphs,” Operations Research Letters, vol. 38, no. 3, pp. 179–184, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  8. M. Schachtebeck, Delay management in public transportation: capacities, robustness, and integration [Ph.D. thesis], Georg-August-Universitat Gottingen, 2010.
  9. L. Wang, Y. Qin, J. Xu, and L. Jia, “A fuzzy optimization model for high-speed railway timetable rescheduling,” Discrete Dynamics in Nature and Society, vol. 2012, Article ID 827073, 22 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  10. L. Wang, W. Mo, Y. Qin, F. Dou, and L. Jia, “Optimization based high-speed railway train rescheduling with speed restriction,” Discrete Dynamics in Nature and Society, vol. 2014, Article ID 934369, 14 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. 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 MathSciNet
  12. H. Niu and M. Zhang, “An optimization to schedule train operations with phase-regular framework for intercity rail lines,” Discrete Dynamics in Nature and Society, vol. 2012, Article ID 549374, 13 pages, 2012. View at Publisher · View at Google Scholar · View at Scopus
  13. H. Niu and X. Zhou, “Optimizing urban rail timetable under time-dependent demand and oversaturated conditions,” Transportation Research Part C: Emerging Technologies, vol. 36, pp. 212–230, 2013. View at Publisher · View at Google Scholar
  14. T. Kis and A. Hertz, “A lower bound for the job insertion problem,” Discrete Applied Mathematics, vol. 128, no. 2-3, pp. 395–419, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. H. Gröflin and A. Klinkert, “Feasible insertions in job shop scheduling, short cycles and stable sets,” European Journal of Operational Research, vol. 177, no. 2, pp. 763–785, 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. H. Gröflin, A. Klinkert, and N. P. Dinh, “Feasible job insertions in the multi-processor-task job shop,” European Journal of Operational Research, vol. 185, no. 3, pp. 1308–1318, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. V. Cacchiani, A. Caprara, and P. Toth, “Scheduling extra freight trains on railway networks,” Transportation Research Part B: Methodological, vol. 44, no. 2, pp. 215–231, 2010. View at Publisher · View at Google Scholar · View at Scopus
  18. R. L. Burdett and E. Kozan, “Techniques for inserting additional trains into existing timetables,” Transportation Research Part B: Methodological, vol. 43, no. 8-9, pp. 821–836, 2009. View at Publisher · View at Google Scholar · View at Scopus
  19. L. Ingolotti, F. Barber, P. Tormos, A. Lova, M. Salido, and M. Abril, “An efficient method to schedule new trains on a heavily loaded railway network,” in Advances in Artificial Intelligence—IBERAMIA 2004, vol. 3315 of Lecture Notes in Computer Science, pp. 164–173, 2004. View at Publisher · View at Google Scholar
  20. H. Flier, T. Graffagnino, and M. Nunkesser, “Scheduling additional trains on dense corridors,” in Experimental Algorithms, vol. 5526 of Lecture Notes in Computer Science, pp. 149–160, Springer, 2009. View at Google Scholar
  21. C. Strotmann, Railway scheduling problems and their decomposition [Ph.D. dissertation], Universität Osnabrück, 2007.