The locomotive routing problem

Transportation Science

Volumn 42, Issue 4, 2008, Pages 492-507

  Vaidyanathan, Balachandran ^a,b   Ahuja, Ravindra K ^a   Orlin, James B ^c  

^a University of Florida   (United States)

^b FedEx   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Locomotive scheduling; Maintenance routing; Mixed integer programming; Network optimization; Paths; Routing

Indexed keywords

COMBINATORIAL OPTIMIZATION; FUELING; INTEGER PROGRAMMING; LOCOMOTIVES; OPTIMIZATION; RAILROADS; SCHEDULING;

MAINTENANCE ROUTING; MIXED INTEGER PROGRAMMING; NETWORK OPTIMIZATION; PATHS; ROUTING;

PROBLEM SOLVING;

EID: 70449631685     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1080.0244     Document Type: Article

References (27)

1. Abara, J. 1989. Applying integer linear programming to the fleet assignment problem. Interfaces 19 20-28.
2. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.
3. Ahuja, R. K., J. Liu, J. B. Orlin, D. Sharma, L. A. Shughart. 2005. Solving real-life locomotive scheduling problems. Transportation Sci. 39 503-517.
4. Barnhart, C., N. L. Boland, L. W. Clarke, E. L. Johnson, G. L. Nemhauser, R. G. Shenoi. 1998. Flight string models for aircraft fleeting and routing. Transportation Sci. 32 208-220.
5. Booler, J. M. P. 1980. The solution of a railway locomotive scheduling problem. J. Oper. Res. Soc. 31 943-948.
6. Booler, J. M. P. 1995. A note on the use of Lagrangean relaxation in railway scheduling. J. Oper. Res. Soc. 46 123-127.
7. Chih, K. C., M. A. Hornung, M. S. Rothenberg, A. L. Kornhauser. 1990. Implementation of a real time locomotive distribution system. T. K. S. Murthy R. E. Rivier, G. F. List, J. Mikolaj, eds. Computer Applications in Railway Planning and Management. Computational Mechanics Publications, Southampton, UK, 39-49.
8. Clarke, L., E. Johnson, G. Nemhauser, Z. Zhu. 1997. The aircraft rotation problem. Ann. Oper. Res. 69 33-46.
9. Cordeau, J. F., F. Soumis, J. Desrosiers. 1998. A Benders decomposition approach for the locomotive and car assignment problem. Technical Report G-98-35, GERAD, Ecole des Hautes Etudes Commerciales de Montreal, Montreal.
10. Cordeau, J. F., P. Toth, D. Vigo. 1998. A survey of optimization models for train routing and scheduling. Transportation Sci. 32 380-404.
11. Feo, T. A., J. F. Bard. 1989. Flight scheduling and maintenance base planning. Management Sci. 35 1415-1432.
12. Fischetti, M., P. Toth. 1997. A package for locomotive scheduling. Technical Report DEIS-OR-97-16, University of Bologna, Bologna, Italy.
13. Florian, M., G. Bushell, J. Ferland, G. Guerin, L. Nastansky 1976. The engine scheduling problem in a railway network. INFOR 14 121-138.
14. Forbes, M. A., J. N. Holt, A. M. Watts. 1991. Exact solution of locomotive scheduling problems. J. Oper. Res. Soc. 42 825-831.
15. Garey M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York.
16. Gopalan, R., K. T. Talluri. 1998. The aircraft maintenance routing problem. Oper. Res. 46 260-272.
17. Maroti, G., L. Kroon. 2005. Maintenance routing for train units: The transition model. Transportation Sci. 39 518-525.
18. Nou, A., J. Desrosiers, F. Soumis. 1997. Weekly locomotive scheduling at Swedish State Railways. Technical Report TRITA/MAT-97-OS12, Royal Institute of Technology, Stockholm, Sweden.
19. Ramani, K. V. 1981. An information system for allocating coach stock on Indian Railways. Interfaces 11 44-51.
20. Rexing, B., C. Barnhart, T. Kniker, A. Jarrah, N. Krishnamurthy. 2000. Airline fleet assignment with time windows. Transportation Sci. 34 1-20.
21. Smith, S., Y. Sheffi. 1988. Locomotive scheduling under uncertain demand. Transportation Res. Records 1251 45-53.
22. Talluri, K. T. 1996. Swapping applications in daily airline fleet assignment. Transportation Sci. 30 237-248.
23. Talluri, K. T. 1998. The four-day aircraft maintenance routing problem. Transportation Sci. 32 43-53.
24. Vaidyanathan, B., R. K. Ahuja, J. Liu, L. A. Shughart. 2007. Real-life locomotive planning: New formulations and computational results. Transportation Res. Part B 42 147-168.
25. Wright, M. B. 1989. Applying stochastic algorithms to a locomotive scheduling problem. J. Oper. Res. Soc. 40 187-192.
26. Ziarati, K., F. Soumis, J. Desrosiers, M. M. Solomon. 1999. A branchfirst, cut-second approach for locomotive assignment. Management Sci. 45 1156-1168.
27. Ziarati, K., F. Soumis, J. Desrosiers, S. Gelinas, A. Saintonge. 1997. Locomotive assignment with heterogeneous consists at CN North America. Eur. J. Oper. Res. 97 281-292.