ИСТИНА |
Войти в систему Регистрация |
|
Интеллектуальная Система Тематического Исследования НАукометрических данных |
||
The algorithms of locomotive’s maintenance scheduling in the depot are described. Algorithms of constraint programming, dynamic programming and heuristic algorithm are presented. The presented statement of the problem corresponds to the work of the Eastern polygon of Russian Railways. Numerical experiments on real data for real depot configurations were carried out to verify the efficiency. The presented algorithms are compared