One of the key assumptions of timetabling algorithms is that a solution exists that meets the pre-specified constraints, like driving times, transfer constraints and headway constraints. If this assumption is satisfied, in most cases a timetable can be found rapidly. Nowadays, railways are being...

The locomotive scheduling problem (or the locomotive assignment problem) is to assign a consist (a set of locomotives) to each train in a pre-planned train schedule so as to provide them sufficient power to pull them from their origins to their destinations. Locomotive scheduling problems are...