A Branch-First, Cut-Second Approach for Locomotive Assignment

References

• Benders J. F. Partitioning procedures for solving mixed variables programming problems. Numerische Math. (1962) 4:238–252Crossref, Google Scholar
• Booler J. M. The solution of railway locomotive scheduling problem. J. Oper. Res. Soc. (1980) 31:943–948Google Scholar
• Bramel J., Simchi-Levi D. Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Oper. Res. (1996) 44:501–509Link, Google Scholar
• Cordeau J.-F., Toth P., Vigo D. A survey of optimization models for train routing and scheduling. Transportation Sci. (1998) 32:380–404Link, Google Scholar
• Cornuejols G., Harche F. Polyhedral study of the capacitated vehicle routing problem. Math. Programming (1993) 60:21–52Crossref, Google Scholar
• Dantzig G. B., Wolfe P. The decomposition algorithm for linear programming. Oper. Res. (1960) 8:101–111Link, Google Scholar
• Desaulniers G., Desrosiers J., Ioachim I., Solomon M. M., Soumis F., Villeneuve D., Crainic T., Laporte G. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. Fleet Management and Logistics (1998) (Kluwer, Boston, MA) 57–93Crossref, Google Scholar
• Desrochers M., Desrosiers J., Solomon M. M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40:342–354Link, Google Scholar
• Fischetti M., Toth P. An additive bounding procedure for combinatorial optimization problems. Oper. Res. (1989) 37:319–328Link, Google Scholar
• Florian M., Bushell G., Ferland J., Guérin 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
• Gamache M., Soumis F., Villeneuve D., Desrosiers J., Gelinas E. The preferential bidding system at Air Canada. Trans. Sci. (1998) 32:246–255Link, Google Scholar
• Kohl N., Desrosiers J., Madsen O. B. G., Solomon M. M., Soumis F. 2-path cuts for the vehicle routing problem with time windows. Trans. Sci. (1999) 33:101–117Link, Google Scholar
• Padberg M. W., Grötschel M., Lawler E. L., Lentra J. K., Rinnooy Kan A. H. G., Shmoys D. B. Polyhedral computations. The Travelling Salesman Problem, A Guided Tour of Combinatorial Optimization (1985) (Wiley, New York) 307–360Google Scholar
• Ribeiro C., Soumis F. A column generation approach to the multiple depot vehicle scheduling problem. Oper. Res. (1994) 42:41–52Link, Google Scholar
• Vance P. H., Barnhart C., Johnson E. L., Nemhauser G. L. Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Appl. (1994) 3:111–130Crossref, Google Scholar
• Vanderbeck F., Wolsey L. A. An exact algorithm for IP column generation. Oper. Res. Lett. (1996) 19:151–159Crossref, Google Scholar
• Wright M. B. Applying stochastic algorithms to a locomotive scheduling problem. J. Oper. Res. Soc. (1989) 40:187–192Crossref, Google Scholar
• Ziarati K., Soumis F., Desrosiers J., Gélinas S., Saintonge A. Locomotive assignment with heterogeneous consist at CN North America. Eur. J. Oper. Res. (1997) 97:281–292Crossref, Google Scholar
• Ziarati K., Soumis F., Desrosiers J., Wilson N. Locomotive assignment using train delays. Computer-Aided Scheduling of Public Transport 7 (1999) (Springer-Verlag, Berlin, Germany) . ForthcomingGoogle Scholar