Solving the Transshipment Yard Scheduling Problem efficiently
Co-authorNils Boysen, Erwin Pesch
In modern rail-rail transshipment yards huge gantry cranes transship containers between different freight trains, so that hub-and-spoke railway systems are enabled. In this context, we consider the transshipment yard scheduling problem (TYSP) in which trains have to be assigned to bundles, which jointly enter and leave the yard. Although feasible solutions can easily be obtained, the problem is NP-hard if certain, realistic objectives are chosen. We present several heuristics as well as one exact algorithm for solving the problem. The presentation concludes with some computational results.