Abstract
Prior to the widespread adoption of unit trains and the rise of intermodal, most traffic moved in “loose car” or “manifest” service (also called “car load traffic”). In this type of service, sets of railcars are grouped together on a temporary basis into “blocks.”
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahuja RK, Jha KC, Liu J (2007) Solving real-life railroad blocking problems. Interfaces 37:404–419
Barnhart C, Jin HH, Vance P (2000) Railway blocking: a network design application. Oper Res 48(2):1–12
Bodin LD, Golden BL, Schuster AD, Romig W (1980) A model for the blocking of trains. Transport Res 14B:115–120
Crainic TG, Ferland JA, Rousseau JM (1984) A tactical planning model for rail freight transportation. Transport Sci 18:165–184
Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Norwell, MA
Gorman MF (1995) An application of genetic and Tabu searches to the freight railroad operation plan problem, INFORMS spring meeting
IBM. The optimization of global railways, http://www-03.ibm.com/ibm/history/ibm100/us/en/icons/smarterrail/
Keaton MH (1989) Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches. Transport Res 23B:363–374
Keaton MH (1992) Designing railroad operating plans: a dual adjustment method for implementing Lagrangian relaxation. Transport Res 26A:263–279
Kraft ER (1998) A reservations-based railway network operations management system, Ph.D. Dissertation, Department of Systems Engineering, University of Pennsylvania, Philadelphia, PA, UMI Order # 9829930
Kwon OK, Martland CD, Sussman JM, Little PD (1995) Origin-to-destination trip times and reliability of rail freight services in North American railroads, Transportation Research Record, No. 1489, pp 1–8
Little PD, Kwon OH, Martland CD (1992) An assessment of trip times and reliability of boxcar traffic, proceedings of the transportation research forum, 34th annual meeting, vol 1, Arlington, VA
Newton HN (1996) Network design under budget constraints with application to the railroad blocking problem, Ph.D. Dissertation, Auburn University, USA
Newton HN, Barnhart C, Vance P (1998) Constructing railway blocking plans to minimize handling costs. Transport Sci 32(4):330–345
Norfolk Southern Corporation. Next generation car routing system at Norfolk Southern. http://www.informs.org/content/download/239255/2274025/file/SC1.pdf
Railway Age (2014) Obituary for guerdon sterling sines, 1928–2014, railroad computer systems pioneer, railway age, 5 Sept 2014. http://www.railwayage.com/index.php/news/guerdon-sterling-sines-1928-2014-railroad-computer-systems-pioneer.html
Simon D (2013) Evolutionary optimization algorithms. Wiley, Hoboken
Van Dyke CD (1986) The automated blocking model: a practical approach to freight railroad blocking plan development. Transport Res Forum 27:116–122
Van Dyke CD (1988) Dynamic management of railroad blocking plans. Transport Res Forum 29:149–152
Yaghini M, Seyedabadi M, Khoshraftar MM (2012) A population-based algorithm for the railroad blocking problem. J Ind Eng Int, SpringerOpen, 8:8 doi:10.1186/2251-712X-8-8
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this chapter
Cite this chapter
Van Dyke, C., Meketon, M. (2015). Railway Blocking Process. In: Patty, B. (eds) Handbook of Operations Research Applications at Railroads. International Series in Operations Research & Management Science, vol 222. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7571-3_5
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7571-3_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7570-6
Online ISBN: 978-1-4899-7571-3
eBook Packages: Business and EconomicsBusiness and Management (R0)