Engine Routing and Scheduling at Industrial In-Plant Railroads

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms and Applications (1993) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46:316–329Link, Google Scholar
• Charnes, Miller A. M. H. A model for the optimal programming of railway freight train movements. Management Sci. (1956) 3:74–92Link, Google Scholar
• Crainic T. G., Rousseau J.-M. The column generation principle and the airline crew pairing problem. INFOR (1987) 25:136–151Google Scholar
• Desaulniers G., Desrosiers J., Solomon M. M., Ribeiro C. C., Hansen p. Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems. Essays and Surveys in Metaheuristics (2001) (Kluwer, Boston, MA) 309–324Google Scholar
• Desaulniers G., Desrosiers J., Ioachim I., Solomon M. M., Soumis F., Villeneuve D., Crainic T. G., 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., Soumis F. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR (1988A) 26:191–212Google Scholar
• Desrochers M., Soumis F. A reoptimization algorithm for the shortest path problem with time windows. European J. Oper. Res. (1988b) 35:242–254Crossref, Google Scholar
• Desrosiers J., Dumas Y. The shortest path problem for the construction of vehicle routes with pick-up, delivery and time constraints. Adv. Optimization and Control, Lecture Notes in Econom. Math. Systems (1988b) 302:144–157Crossref, Google Scholar
• Desrosiers J., Dumas Y., Soumis F. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. Amer. J. Math. Management Sci. (1986) 6:301–326Crossref, Google Scholar
• Desrosiers J., Pelletier P., Soumis F. Plus court chemin avec contraintes d'horaires. RAIRO Recherche Opér (1983) 17:357–377Crossref, Google Scholar
• Desrosiers J., Dumas Y., Solomon M. M., Soumis F., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Time constrained routing and scheduling. Network Routing, Handbooks in Operations Research and Management Science (1995) 8(North-Holland, Amsterdam, The Netherlands)35–139Google Scholar
• Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. Eur. J. Oper. Res. (1991) 54:7–22Crossref, Google Scholar
• Gegen C., Dejax P., Dror M., Feillet D., Gendreau M. An exact algorithm for the elementary shortest path problem with resource constraints. (2000) . Technical Report CRT-2000-15, C.R.T. Montréal, CanadaGoogle Scholar
• Ibaraki T.Enumerative Approaches to Combinatorial Optimization, Annals of Operations Research (1987) 10–11BaltzerGoogle Scholar
• Lübbecke M. E. Dual variable based fathoming in dynamic programs used for column generation. (1999) . Technical report, Dept. Mathematical Optimization, Braunschweig University of Technology. SubmittedGoogle Scholar
• Lübbecke M. E. Combinatorial restrictions on pickup and delivery paths. (2001a) . Technical report, Dept. Mathematical Optimization, Braunschweig University of Technology. SubmittedGoogle Scholar
• Lübbecke M. E. Engine scheduling by column generation. (2001b) . Ph.D. thesis, Braunschweig University of TechnologyGoogle Scholar
• Lübbecke M. E., Zimmermann U. T., Jöger W., Krebs H.-J. Computer aided scheduling of switching engines. Mathematics—Key Technology for the Future: Joint Projects Between Universities and Industry (2003) (Springer, Berlin, Germany) 690–703Google Scholar
• Reingold E. M., Nievergelt J., Deo N.Combinatorial Algorithms—Theory and Practice (1977) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Savelsbergh M. W. P., Sol M. The general pickup and delivery problem. Trans. Sci. (1995) 29:17–29Link, Google Scholar
• Savelsbergh M. W. P., Sol M. DRIVE: Dynamic routing of independent vehicles. Oper. Res. (1998) 46:474–490Link, Google Scholar
• Sol M. Column generation techniques for pickup and delivery problems. (1994) . Ph.D. thesis, Eindhoven University of TechnologyGoogle Scholar