An optimization model for empty freight car assignment at Union Pacific Railroad

Interfaces

Volumn 38, Issue 2, 2008, Pages 89-102

  Narisetty, Amar Kumar ^a   Richard, Jean Philippe P ^a   Ramcharan, David ^b   Murphy, Deby ^c   Minks, Gayle ^c   Fuller, Jim ^d  

^a SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

^b Customer Product Operations Support   (United States)

^c UNION PACIFIC RAILROAD   (United States)

^d Golden Years Consulting Services   (United States)

Author keywords

Assignment; Freight cars; Linear programming; Railroads; Transportation

Indexed keywords

EID: 61349118132     PISSN: 00922102     EISSN: 1526551X     Source Type: Journal    
DOI: 10.1287/inte.1070.0330     Document Type: Article

References (16)

1. Cheung, R. K., W. B. Powell. 1996. An algorithm for multistage dynamic networks with random arc capacities with an application to dynamic fleet management. Oper. Res. 44(6) 951-963.
2. Cordeau, J.-F., P. Toth, D. Vigo. 1998. A survey of optimization models for train routing and scheduling. Transportation Sci. 32(4) 380-404.
3. Crainic, T. G., M. Gendreau, P. Dejax. 1993. Dynamic and stochastic models for the allocation of empty containers. Oper. Res. 41(1) 102-126.
4. Dejax, P. J., T. G. Crainic. 1987. A review of empty flows and fleet management models in freight transportation. Transportation Sci. 21(4) 227-247.
5. Hitchcock, F. L. 1941. The distribution of a product from several sources to numerous localities. J. Math. Phys. 20 224-230.
6. Joborn, M., T. G. Crainic, M. Gendreau, K. Holmberg, J. T. Lundgren. 2004. Economies of scale in empty freight car distribution in scheduled railways. Transportation Sci. 38(2) 121-134.
7. Jordan, W. C., M. A. Turnquist. 1983. A stochastic, dynamic network model for railroad car distribution. Transportation Sci. 17(2) 123-145.
8. Kantorovich, L. V. 1960. Mathematical methods in the organization and planning of production. Management Sci. 6 366-422.
9. Koopmans, T. C. 1949. Optimum utilization of the transportation system. Econometrica 17 136-146.
10. Misra, S. C. 1972. Linear programming of empty wagon disposition. Rail Intermit. 3 151-158.
11. Nazareth, J. L. 1987. Computer Solutions of Linear Programs. Oxford University Press, New York.
12. Powell, W. B., T. A. Carvalho. 1997. Dynamic control of multicommodity fleet management problems. Eur. J. Oper. Res. 98 522-541.
13. Powell, W. B., T. A. Carvalho. 1998. Dynamic control of logistics queueing network for large-scale fleet management. Report, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ.
14. Powell, W. B., P. Jaillet, A. Odoni. 1995. Stochastic and dynamic networks and routing. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Handbooks in Operations Research and Management Science, Vol. 8: Network Routing. North-Holland, Amsterdam, 141-295.
15. Spieckermann, S., S. Vob. 1995. A case study in empty railcar distribution. Eur. J. Oper. Res. 87 586-598.
16. White, W. W., A. M. Bomberault. 1969. A network algorithm for empty freight car allocation. IBM Systems J. 8 147-169.