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.
No takes yet. Share an insight, caveat, or question.
Forbes et al. (1991) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: