Two-Station Single Track Scheduling Problem

Zinder, Y.; Lazarev, A.A.; Musatova, E.G.; Tarasov, I.A.; Khusnullin, N.F.

Информация о цитировании статьи получена из Web of Science, Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 2 декабря 2016 г.

Авторы: Zinder Yakov, Lazarev Alexander A., Musatova Elena G., Tarasov Ilia A., Khusnullin Nail F.
Журнал: IFAC-PapersOnLine
Том: 49
Номер: 12
Год издания: 2016
Издательство: Elsevier Ltd
Местоположение издательства: London
Первая страница: 231
Последняя страница: 236
DOI: 10.1016/j.ifacol.2016.07.604
Аннотация: 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.
Добавил в систему: Тарасов Илья Алексеевич

	ИСТИНА	Войти в систему Регистрация
	ИПМех РАН
	Главная Поиск Статистика О проекте Помощь

ИСТИНА

ИПМех РАН

Two-Station Single Track Scheduling Problemстатья

Прикрепленные файлы