This 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. © 1989, Operational Research Society Ltd.
CITATION STYLE
Wright, M. B. (1989). Applying stochastic algorithms to a locomotive scheduling problem. Journal of the Operational Research Society, 40(2), 187–192. https://doi.org/10.1057/jors.1989.23
Mendeley helps you to discover research relevant for your work.