Engine routing and scheduling at industrial in-plant railroads

Transportation Science

Volumn 37, Issue 2, 2003, Pages 183-197

  Lübbecke, Marco E ^a   Zimmermann, Uwe T ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; PLANNING; PROBLEM SOLVING; SCHEDULING; TRANSPORTATION ROUTES;

ENGINE ROUTING; INDUSTRIAL IN-PLANT RAILROADS;

RAILROADS;

EID: 0042706232     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.37.2.183.15251     Document Type: Article

References (23)

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