Solving Real-Life Locomotive-Scheduling Problems

References

• Aarts E. H. L., Lenstra J. K.Local Search in Combinatorial Optimization (1997) (John Wiley & Sons, New York) Google Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Ahuja R. K., Orlin J. B., Sharma D. Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem. Math. Programming (2001a) 91:71–97Crossref, Google Scholar
• Ahuja R. K., Orlin J. B., Sharma D. A very large-scale neighborhood search algorithm for the combined through-fleet assignment model. INFORMS J. Comput. (2001b) . Submitted toGoogle Scholar
• Ahuja R. K., Ergun O., Orlin J. B., Punnen A. P. A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. (2002) 123:75–102Crossref, Google Scholar
• Chih K. C., Hornung M. A., Rothenberg M. S., Kornhauser A. L., Murthy T. K. S., Rivier R. E., List G. F., Mikolaj J. Implementation of a real time locomotive distribution system. Computer Applications in Railway Planning and Management (1990) (Computational Mechanics Publications, Southampton, UK) 39–49Google Scholar
• Cordeau J.-F., Toth P., Vigo D. A survey of optimization models for train routing and scheduling. Transportation Sci. (1998) 32:988–1005Link, Google Scholar
• Fischetti M., Toth P. A package for locomotive scheduling. (1997) . Technical Report DEIS-OR-97-16, University of Bologna, ItalyGoogle Scholar
• Florian M., Bushell G., Ferland J., Guerin G., Nastansky L. The engine scheduling problem in a railway network. INFOR (1976) 14:121–138Google Scholar
• Forbes M. A., Holt J. N., Watts A. M. Exact solution of locomotive scheduling problems. J. Oper. Res. Soc. (1991) 42:825–831Crossref, Google Scholar
• Garey M. S., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman)Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Norwell, MA) Crossref, Google Scholar
• Nou A., Desrosiers J., Soumis F. Weekly locomotive scheduling at Swedish state railways. (1997) . Technical Report G-97-35, GERAD, École des Hautes Etudes Commercials de Montréal, CanadaGoogle Scholar
• Smith S., Sheffi Y. Locomotive scheduling under uncertain demand. Transportation Res. Record (1988) 1251:45–53Google Scholar
• Ziarati K., Soumis F., Desrosiers J., Solomon M. M. A branch-first, cut-second approach for locomotive assignment. Management Sci. (1999) 45:1156–1168Link, Google Scholar
• Ziarati K., Soumis F., Desrosiers J., Gelinas S., Saintonge A. Locomotive assignment with heterogeneous consists at CN North America. Eur. J. Oper. Res. (1997) 97:281–292Crossref, Google Scholar