You are not currently logged in.
Access JSTOR through your library or other institution:
Solving Real-Life Railroad Blocking Problems
Ravindra K. Ahuja, Krishna C. Jha and Jian Liu
Vol. 37, No. 5 (Sep. - Oct., 2007), pp. 404-419
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/20141527
Page Count: 16
You can always find the topics here!Topics: Shipments, Algorithms, Railroad trains, Mathematical problems, Automobiles, Transportation, Freight, Rail freight, Mailbags, Rail industry
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
Each major US railroad ships millions of cars over its network annually. To reduce the intermediate handlings of shipments as they travel over the railroad network, a set of shipments is classified (or grouped together) at a railroad yard to create a block. The railroad blocking problem is to identify this classification plan for all shipments at all yards in the network to minimize the total shipment cost, i.e., to create a blocking plan. The railroad blocking problem is a very large-scale, multicommodity, flow-network-design and routing problem with billions of decision variables. Its size and mathematical difficulty preclude solving it using any commercial software package. We developed an algorithm using an emerging technique known as very large-scale neighborhood (VLSN) search that is able to solve the problem to near optimality using one to two hours of computer time on a standard workstation computer. This algorithm can also handle a variety of practical and business constraints that are necessary for implementing a solution. When we applied this algorithm to the data that several railroads provided us, the computational results were excellent. Three Class I railroad companies (a Class I railroad, as defined by the Association of American Railroads, has an operating revenue exceeding $319.3 million) in the United States--CSX Transportation, Norfolk Southern Corporation, and Burlington Northern and Santa Fe Railway--used it in developing their operating plans. Two US Class I railroads have also licensed it for regular use in developing their operating plans, and other railroads are showing considerable interest. We expect this algorithm to become an industry standard for freight railroads worldwide. In this paper, we outline our algorithm, show the computational results we received using real data, and describe areas for future research.
Interfaces © 2007 INFORMS