Two-Station Single Track Scheduling Problem

Publisher:
Elsevier
Publication Type:
Conference Proceeding
Citation:
IFAC papers online, 2016, 49 (12), pp. 231 - 236
Issue Date:
2016
Full metadata record
Files in This Item:
Filename Description Size
Published paper.pdfPublished version387.17 kB
Adobe PDF
Single track segments are common in various railway networks, in particular in various supply chains. For such a segment, connecting two stations, the trains form two groups, depending on what station is the initial station for the journey between these two stations. Within a group the trains differ by their cost functions. It is assumed that the single track is sufficiently long so several trains can travel in the same direction simultaneously. The paper presents polynomial-time algorithms for different versions of this two-station train scheduling problem with a single railway track. The considered models differ from each other by their objective functions.
Please use this identifier to cite or link to this item: