Exact Solution of Locomotive Scheduling Problems

Michael A. Forbes, J. N. Holt, A. M. Watts

Journal of the Operational Research Society · 1991 · 55 citations · 6 references

Concepts

Abstract

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.

References

6