Algorithms for locomotives maintenance schedule ?

摘要

This paper is devoted to the problem of scheduling maintenance of locomotives in a depot. The problem is based on the operation of Eastern polygon of Russian Railways. A heuristic algorithm and a constraint programming model are presented. Numerical experiments on real data for real depot configurations were carried out to compare the performance of the heuristic algorithm and constraint programming model solved with IBM ILOG CPLEX Optimizer.