Economies of scale in empty freight car distribution in scheduled railways

Transportation Science

Volumn 38, Issue 2, 2004, Pages 121-134

  Joborn, Martin ^a   Crainic, Teodor Gabriel ^b,c   Gendreau, Michel ^b   Holmberg, Kaj ^d   Lundgren, Jan T ^e  

^a Carmen Consulting   (Sweden)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^d LINKÖPING INSTITUTE OF TECHNOLOGY   (Sweden)

^e LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Empty freightcar distribution; Scheduled railways; Tabu search; Time dependent capacitated network design

Indexed keywords

COST BENEFIT ANALYSIS; ECONOMICS; FREIGHT TRANSPORTATION; HEURISTIC METHODS; MATHEMATICAL MODELS; NUMERICAL METHODS; OPTIMIZATION; PLANNING; RAILROAD YARDS AND TERMINALS; SCHEDULING;

SCHEDULED RAILWAY SYSTEM; TABU SEARCH METHOD; TIME DEPENDENT CAPACITATED NETWORK; TRANSPORTATION PATTERN;

FREIGHT CARS;

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

References (18)

1. Balakrishnan, A., T. L. Magnanti, P. Mirchandani. 1997. Network design. M. Dell'Amico, F. Maffioli, S. Martello, eds. Annotated Bibliographies in Combinatorial Optimization. John Wiley & Sons, New York, 311-334.
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. 2000. Network design in freight transportation. Eur. J. Oper. Res. 122(2) 272-288.
4. Crainic, T. G., M. Gendreau, K. Holmberg, M. Joborn, J. T. Lundgren. 1997. A tabu heuristic for the network design problem with fixed costs on paths. Working Paper LiTH-MAT-WP-1997-01, Department of Mathematics, Linköping University, Linköping, Sweden.
5. 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.
6. Gendreau, M., A. Hertz, G. Laporte. 1994. A tabu search heuristic for the vehicle routing problem. Management Sci. 40 1276-1290.
7. Glover, F., M. Laguna, 1997. Tabu Search. Kluwer Academic Publishers, Norwell, MA.
8. Haghani, A. E. 1989. Formulation and solution of combined train routing and makeup, and empty car distribution model. Transportation Res. 23B(6) 433-452.
9. Holmberg, K., M. Joborn, J. T. Lundgren. 1998. Improved empty freight car distribution. Transportation Sci. 32(2) 163-173.
10. Hughes, R., W. B. Powell. 1988. Mitigating end effects in the dynamic vehicle allocation model. Management Sci. 34(7) 859-879.
11. ILOG. 1999. ILOG CPLEX 6.5. ILOG, Mountain View, CA.
12. Joborn, M. 2001. Optimization of empty freight car distribution in scheduled railways. Ph.D. thesis, Department of Mathematics, University of Linköping, Linköping, Sweden.
13. Magnanti, T. L., R. T. Wong. 1986. Network design and transportation planning: Models and algorithms. Transportation Sci. 18(1) 1-55.
14. Minoux, M. 1986. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks 19 313-360.
15. Powell, W. B., T. A. Carvalho. 1998a. Dynamic control of logistics queueing networks for large-scale fleet management. Transportation Sci. 32(2) 90-109.
16. Powell, W. B., T. A. Carvalho. 1998b. Real-time optimization of containers and flatcars for intermodal operations. Transportation Sci. 32(2) 110-126.
17. Powell, W. B., T. A. Carvalho, G. A. Godfrey, H. P. Simao. 1995. Dynamic fleet management as a logistics queueing network. Ann. Oper. Res. 61 165-188.
18. Turnquist, M. A. 1994. Economies of scale and network optimization for empty car distribution. Technical report, Cornell University, Ithaca, NY.