Article ID: | iaor19921499 |
Country: | United Kingdom |
Volume: | 40 |
Issue: | 10 |
Start Page Number: | 825 |
End Page Number: | 831 |
Publication Date: | Oct 1991 |
Journal: | Journal of the Operational Research Society |
Authors: | Holt J.N., Forbes M.A., Watts A.M. |
Keywords: | transportation: rail, Transportation: Rail, scheduling |
Given 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.