Robust train formation planning

Proceedings of the Institution of Mechanical Engineers, Part F: Journal of Rail and Rapid Transit

Volumn 224, Issue 2, 2010, Pages 75-90

  Shafia, M A ^a   Sadjadi, S J ^a   Jamili, A ^a  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Heuristic algorithm; Mixed integer programming; Perturbation; Robust approach; Train formation problem

Indexed keywords

HEURISTIC APPROACH; INPUT DATAS; MIXED INTEGER MODELS; MIXED INTEGER PROGRAMMING; NEAR-OPTIMAL SOLUTIONS; OPTIMAL SOLUTIONS; PLANNING MODELS; REAL-WORLD;

DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; LOCOMOTIVES; OPTIMAL SYSTEMS; RAILROAD CARS;

INTEGER PROGRAMMING;

EID: 77949884500     PISSN: 09544097     EISSN: None     Source Type: Journal    
DOI: 10.1243/09544097JRRT295     Document Type: Article

References (21)

1. Cordeau, J., Toth, P., and Vigo, D. A survey of optimization models for train routing and scheduling.Transp. Sci., 1998, 32(4).
2. Thomet, A. A user-oriented freight railroad operating policy. IEEE Trans. Syst.Man Cybern., 1971, 1, 349-356.
3. Crainic, T. G., Ferland, J. A., and Rousseau, J. M. A tactical planning model for rail freight transportation. Transp. Sci., 1984, 18(2), 165-184.
4. Keaton, M. H. Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches. Transp. Res., 1989, 23B, 415-431.
5. Keaton, M. H. Designing railroad operating plans: a dual adjustment method for implementing Lagrangian relaxation. Transp. Sci., 1992, 26, 263-279.
6. Lin, C. C. The freight routing problem of time-definite freight delivery common wagonriers. Transp. Res. B, 2001, 35, 525-547.
7. Marin, A. and Salmeron, J. Tactical design of rail freight networks. Part 1: exact and heuristic methods. Eur. J. Oper. Res., 1996, 90, 26-44.
8. Marin, A. and Salmeron, J. Tactical design of rail freight networks. Part 2: local search method with statistical analysis. Eur. J. Oper. Res., 1996, 94, 43-53.
9. Morlok, E. K., and Peterson, R. B. Final report on a development of a geographic transportation network generation and evaluation model. J. Trans. Res. Forum, 1970, 11, 71-105.
10. Huntley, C. L., Brown, D. E., Sappington, D. E., and Markowicz, B. P. Freight routing and scheduling at CSX Transportation. Interfaces, 1995, 25(3), 58-71.
11. Gorman, M. F. An application of genetic and Tabu searches to the freight railroad operating plan problem. Ann. Oper. Res., 1998, 78, 51-69.
12. Godwin, T., Gopalan, R., and Narendrant, T. T. Freight train routing and scheduling in a passenger rail network: computational complexity and the stepwise dispatching heuristic. Asia-Pac. J. Oper. Res. (APJOR), 2007, 24, (4), 499-533.
13. Fatholahi, A., Arbabi, E., Heshmati, M., Bahrami, M., Kianfar, Y., and Judkhah, A. Railway running general regulations (in Persian), 1990 (RAI, Iran).
14. Ben-Tal, A. and Nemirovski, A. Robust solutions of linear programming problems contaminated with uncertain data.Math. Prog. A, 2000, 88, 411-424.
15. Bertsimas,D. and Sim, M. The price of robustness. Oper. Res., 2004, 52, 35-53.
16. Soyster, A. L. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res., 1973, 21, 1154-1157.
17. Ben-Tal, A. and Nemirovski, A. Robust convex optimization.Math. Oper. Res., 1998, 23, 769-805.
18. Ben-Tal, A. and Nemirovski, A. Robust solutions to uncertain linear programs. Oper. Res. Lett., 1999, 25, 1-13.
19. Ben-Tal, A., El-Ghaoui, L., and Nemirovski, A. Robust semidefinite programming. In Handbook on semidefinite programming (Eds R. Saigal, H. Wolkowitcz, and L. Vandenberghe), 2000, pp. 139-162 (Kluwer Academic Publishers, Dordrecht, Holland).
20. El-Ghaoui, L. and Lebret, H. Robust solutions to leastsquare problems with uncertain data matrices. SIAM J.Matrix Anal. Appl., 1997, 18, 1035-1064.
21. El-Ghaoui, L.,Oustry,F.,and Lebret,H. Robust solutions to uncertain semidefinite programs. SIAM J. Optim., 1998, 9, 33-52.