Exact Solution of Locomotive Scheduling Problems
作者:
ForbesM. A.,
HoltJ. N.,
WattsA. M.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1991)
卷期:
Volume 42,
issue 10
页码: 825-831
ISSN:0160-5682
年代: 1991
DOI:10.1057/jors.1991.163
出版商: Taylor&Francis
关键词: integer programming;railways;scheduling
数据来源: Taylor
摘要:
AbstractGiven a daily repeating timetable and locomotives of various types, each timetabled train must be assigned a locomotive. This paper presents an exact algorithm for the solution of this problem, based on an approach used to solve multiple-depot bus scheduling problems. The algorithm is used to solve moderately large scheduling problems drawn from real world data.
点击下载:
PDF (3341KB)
返 回