Freight Transport by Rail

  • Katta G. MurtyEmail author
  • Bodhibrata Nag
  • Omkar D. Palsule-Desai
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 212)


The train design problem (also called "block-to-train assignment problem") is a difficult combinatorial optimization problem encountered daily in the freight railroad industry. In 2011, the Railway Applications Society (RAS) of the professional society INFORMS had set up a competition problem of this based on a simplified real-life instance, which is the basis for this chapter. In this chapter we discuss this problem, and develop an algorithm for it based on the minimum cost spanning tree approach, and the solution of the RAS 2011 contest problem using it.


Destination Node Greedy Algorithm Column Generation Master Problem Work Event 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Supplementary material

273578_1_En_16_MOESM1_ESM.pdf (50 kb)
(pdf 50 KB)


  1. 1.
    Assad, A. A. (1980). Models for rail transportation. Transportation Research, 14A, 205–220.CrossRefGoogle Scholar
  2. 2.
    Carpara, A., Fischetti, M., & Toth, P. (2002). Modeling and solving the train timetabling problem. Operations Research, 50, 851–861.CrossRefGoogle Scholar
  3. 3.
    Crainic, T. G., & Rousseau, J. M. (1986). Multicommodity, multimode Freight transportation: A general modeling and algorithmic framework for the service network design problem. Transportation Research, 208, 225–242.CrossRefGoogle Scholar
  4. 4.
    Dorfman, M. J., & Medanic, J. (2004). Scheduling trains on a railway network using a discrete event model of railway traffic. Transportation Research B, 38, 81–98.CrossRefGoogle Scholar
  5. 5.
    Gorman, M. F. (1998). The Freight railroad operating plan problem. Annals of Operations research, 78, 51–69.CrossRefGoogle Scholar
  6. 6.
    Jha, K. C., Ahuja, R. K., & Sahin, G. (2008). New approaches for solving the block-to train assignment problem. Networks, 51, 48–62.CrossRefGoogle Scholar
  7. 7.
    Keaton, M. H. (1989). Designing optimal raiload operating plans: Lagrangian relaxation and heuristic approaches. Transportation Research, 23B, 415–431; Also (1992) Designing optimal railroad operating plans: A dual adjustment method for implementing Lagrangian relaxation, Transportation Science, 26, 262–279.CrossRefGoogle Scholar
  8. 8.
    Lina, B. L., Wanga, Z. M., Jia, L. J., Tiana, Y. M., & Zhoud, G. Q. (2012). Optimizing the Freight train connection service network of a large-scale rail system. Transportation Research, 46B, 649–667.CrossRefGoogle Scholar
  9. 9.
    Murty, K. G. (1992). Network programming. New York: Prentice-Hall.Google Scholar
  10. 10.
    Newton, A. M., & Yano, C. A. (2001). Scheduling trains and containers with due dates and dynamic arrivals. Transportation Science, 35, 181–191.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Katta G. Murty
    • 1
    Email author
  • Bodhibrata Nag
    • 2
  • Omkar D. Palsule-Desai
    • 3
  1. 1.Department of Industrial and Operations EngineeringUniversity of MichiganAnn ArborUSA
  2. 2.Operations Management GroupIndian Institute of Management CalcuttaCalcuttaIndia
  3. 3.Indian Institute of ManagementIndoreIndia

Personalised recommendations