Scheduling freight trains traveling on complex networks

Transportation Research Part B: Methodological

Volumn 45, Issue 7, 2011, Pages 1103-1123

  Mu, Shi ^a   Dessouky, Maged ^a  

^a University of Southern California   (United States)

Author keywords

Heuristics; Optimization; Scheduling; Trains

Indexed keywords

COMPLEX NETWORKS; FREIGHT CARS; HEURISTIC ALGORITHMS; OPTIMIZATION; RAILROAD TRANSPORTATION; RAILROADS; RAILS; SCHEDULING; TRANSPORTATION;

ASSOCIATION OF AMERICAN RAILROADS; HEURISTICS; MATHEMATICAL FORMULATION; NEIGHBORHOOD SEARCH ALGORITHMS; PLANNING AND SCHEDULING; RAILWAY TRANSPORTATION; SCHEDULING PROBLEM; TRAINS;

FREIGHT TRANSPORTATION;

ALGORITHM; DECOMPOSITION ANALYSIS; FREIGHT TRANSPORT; HEURISTICS; OPTIMIZATION; RAILWAY TRANSPORT; RESEARCH WORK; TIME DEPENDENT BEHAVIOR; TRANSPORTATION PLANNING; TRAVEL DEMAND;

UNITED STATES;

EID: 79959786879     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2011.05.021     Document Type: Article

References (24)

1. Ahuja, R.K., Cunha, C.B., Sahin, G., 2005. Network models in railroad planning and scheduling. In: Greenberg, H.J., Smith, J.C., (Eds.), TutORials in Operations Research, pp. 54-101.
2. Borndörfer R., Schlechte T. Solving railway track allocation problems. Operations Research Proceedings 2007 2008, 117-122. Springer-Verlag. J. Kalcsics, S. Nickel (Eds.).
3. Cacchiani V., Caprara A., Toth P. Scheduling extra freight trains on railway networks. Transportation Research Part B 2010, 44(2):215-231.
4. Caimi, G., 2009. Algorithmic Decision Support for Train Scheduling in a Large and Highly Utilized Railway Network. Ph.D. Thesis, ETH Zurich.
5. Caprara, A., Kroon, L.G., Monaci, M., Peeters, M., Toth, P., 2006. Passenger railway optimization. In: Barnhart, C., Laporte, G. (Eds.), Handbooks in Operations Research and Management Science, vol. 14, pp. 129-187.
6. Caprara A., Fischetti M., Toth P. Modeling and solving the train timetabling problem. Operations Research 2002, 50(5):851-861.
7. Carey M. A model and strategy for train pathing with choice of lines, platforms, and routes. Transportation Research Part B 1994, 28(5):333-353.
8. Carey M. Extending a train pathing model from one-way to two-way track. Transportation Research Part B 1994, 28(5):395-400.
9. Carey M., Lockwood D. A model, algorithms and strategy for train pathing. Journal of Operation Research Society 1995, 46(8):988-1005.
10. Cordeau J., Toth P., Vigo D. A survey of optimization models for train routing and scheduling. Transportation Science 1998, 32(4):380-404.
11. Corman F., D'Ariano A., Pacciarelli D., Pranzo M. A tabu search algorithm for rerouting trains during rail operations. Transportation Research Part B 2010, 44(1):175-192.
12. D'Ariano A., Pacciarelli D., Pranzo M. A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research 2007, 183(2):643-657.
13. Dessouky M., Lu Q., Zhao J., Leachman R.C. An exact solution procedure for determining the optimal dispatching times for complex rail networks. IIE Transaction 2006, 38(2):141-152.
14. Higgins A., Kozan E., Ferreira L. Optimal scheduling of trains on a single line track. Transportation Research Part B 1996, 30(2):147-161.
15. Huntley C.L., Brown D.E., Sappington D.E., Markowicz B.P. Freight routing and scheduling at CSX transportation. Interfaces 1995, 25(3):58-71.
16. Kraay D.R., Harker P.T. Real-time scheduling of freight railroads. Transportation Research Part B 1995, 29(3):213-229.
17. Kraay D.R., Harker P.T., Chen B. Optimal pacing of trains in freight railroads: model formulation and solution. Operations Research 1991, 39(1):82-99.
18. Lu Q., Dessouky M., Leachman R.C. Modeling train movements through complex rail networks. ACM Transactions on Modeling and Computer Simulation 2004, 14(1):48-75.
19. Lusby R.M., Larsen J., Ehrgott M., Ryan D. Railway track allocation: models and methods. OR Spectrum 2009, 10.1007/s00291-009-0189-0.
20. Ping, L., Axin, N., Limin, J., Fuzhang, W., 2001. Study on intelligent train dispatching. In: Proceedings of 2001 Intelligent Transportation Systems Conference, pp. 949-953.
21. Sahin, G., Ahuja, R.K., Cunha, C.B., 2004. New approaches for the train dispatching problem. In: INFORMS Annual Meeting, Denver, Colorado, USA.
22. Tornquist J., Persson J.A. N-tracked railway traffic re-scheduling during disturbances. Transportation Research Part B 2007, 41(3):342-362.
23. Suteewong, W., 2006. Algorithms for Solving the Train Dispatching Problem for General Networks. Ph.D. Thesis, University of Southern California.
24. Zhou X., Zhong M. Single-track train timetabling with guaranteed optimality: branch-and-bound algorithms with enhanced lower bounds. Transportation Research Part B 2007, 41(3):320-341.