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.

How to Cite this Article

Yuyan Tan and Zhibin Jiang, “A Branch and Bound Algorithm and Iterative Reordering Strategies for Inserting Additional Trains in Real Time: A Case Study in Germany,” Mathematical Problems in Engineering, vol. 2015, Article ID 289072, 12 pages, 2015. doi:10.1155/2015/289072