Freight Transport by Rail
Katta G. Murty (),
Bodhibrata Nag and
Omkar D. Palsule-Desai ()
Additional contact information
Katta G. Murty: University of Michigan
Omkar D. Palsule-Desai: Indian Institute of Management
Chapter 16 in Case Studies in Operations Research, 2015, pp 391-411 from Springer
Abstract:
Abstract 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.
Keywords: Destination Node; Greedy Algorithm; Column Generation; Master Problem; Work Event (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4939-1007-6_16
Ordering information: This item can be ordered from
http://www.springer.com/9781493910076
DOI: 10.1007/978-1-4939-1007-6_16
Access Statistics for this chapter
More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().