Open AccessJournal Article
Solution of a railroad locomotive scheduling problem
TLDR
A heuristic method, based on a linear programming model, gives good integer solutions to the problem of finding a minimum cost set of schedules for railway locomotives to work a given set of trains.Abstract:
A method is described for finding a minimum cost set of schedules for railway locomotives to work a given set of trains. The times at which the trains start may be fixed or variable. A heuristic method, based on a linear programming model, is described. This gives good integer solutions to the problem.read more
Citations
More filters
Journal ArticleDOI
The Locomotive Routing Problem
TL;DR: Robust optimization methods to solve the locomotive routing problem as an integer programming problem on a suitably constructed space-time network and it is shown that this problem is NP-Complete.