Applying stochastic algorithms to a locomotive scheduling problem

  • Wright M
  • 9


    Mendeley users who have this article in their library.
  • 10


    Citations of this article.


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.

Author-supplied keywords

  • Heuristics
  • Railways
  • Scheduling
  • Simulated annealing

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • M. B. Wright

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free