A Generalized Approach for Train Marshalling

Elias Dahlhaus ()
Additional contact information
Elias Dahlhaus: Darmstadt University of Technology

Chapter Chapter 49 in Operations Research Proceedings 2022, 2023, pp 411-417 from Springer

Abstract: Abstract In a distributer freight train, its cars have to be sorted in such a way that during the trip of the train, only cars on the rear the train are left at any intermediate stop. The sorting requirements of the freight cars of a distributer train will be described in this paper. Then an algorithm is introduced that minimizes the number of tracks that are necessary to get the freight cars sorted in a hump yard, such that the sorting requirements are fulfilled. The algorithm is a dynamic programming approach and generalizes the algorithm of Falsafain and Tamannaei.

Keywords: Train marshalling; Dynamic programming; PQ-tree (search for similar items in EconPapers)
Date: 2023
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:lnopch:978-3-031-24907-5_49

Ordering information: This item can be ordered from
http://www.springer.com/9783031249075

DOI: 10.1007/978-3-031-24907-5_49

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().