Applying Stochastic Algorithms to a Locomotive Scheduling Problem
作者:
WrightM. B.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1989)
卷期:
Volume 40,
issue 2
页码: 187-192
ISSN:0160-5682
年代: 1989
DOI:10.1057/jors.1989.23
出版商: Taylor&Francis
关键词: heuristics;railways;scheduling;simulated annealing
数据来源: Taylor
摘要:
AbstractThis paper addresses a problem common to all railway networks. Given a fixed train timetable and locomotives (or other forms of traction) of various types, each train must be allocated a locomotive. This paper examines the use of stochastic algorithms for such a problem. Two types of algorithm are used—a simple‘local improvement’method, performed successively from randomly chosen starting points, and a‘simulated annealing’approach. Both are found to give considerably better results than a deterministic method in current use, and the annealing approach is probably the better stochastic method.
点击下载:
PDF (2938KB)
返 回