Two-Station Single Track Scheduling Problem

Zinder, Y; Lazarev, AA; Musatova, EG; Tarasov, IA; Khusnullin, NF

Two-Station Single Track Scheduling Problem

Zinder, Y

Lazarev, AA Musatova, EG Tarasov, IA Khusnullin, NF

Permalink

Publication Type:: Conference Proceeding
Citation:: IFAC-PapersOnLine, 2016, 49 (12), pp. 231 - 236
Issue Date:: 2016-01-01

Closed Access

	Filename	Description	Size
	Published paper.pdf	Published version	387.17 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zinder, Y https://orcid.org/0000-0003-2024-8129	en_US
dc.contributor.author	Lazarev, AA	en_US
dc.contributor.author	Musatova, EG	en_US
dc.contributor.author	Tarasov, IA	en_US
dc.contributor.author	Khusnullin, NF	en_US
dc.date.issued	2016-01-01	en_US
dc.identifier.citation	IFAC-PapersOnLine, 2016, 49 (12), pp. 231 - 236	en_US
dc.identifier.uri	http://hdl.handle.net/10453/98264
dc.description.abstract	© 2016 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.	en_US
dc.relation.ispartof	IFAC-PapersOnLine	en_US
dc.relation.isbasedon	10.1016/j.ifacol.2016.07.604	en_US
dc.title	Two-Station Single Track Scheduling Problem	en_US
dc.type	Conference Proceeding
utslib.citation.volume	12	en_US
utslib.citation.volume	49	en_US
utslib.for	010206 Operations Research	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	closed_access
pubs.issue	12	en_US
pubs.publication-status	Published	en_US
pubs.volume	49	en_US

Abstract:

© 2016 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:

http://hdl.handle.net/10453/98264