A Problem of Scheduling Operations at a Locomotive Maintenance Depot

被引:0
|
作者
Lazarev, A. A. [1 ,2 ,3 ,4 ]
Musatova, E. G. [1 ]
Grishin, E. M. [1 ,2 ]
Tarasov, G., V [1 ,2 ]
Galakhov, S. A. [1 ,2 ]
Pravdivets, N. A. [1 ]
机构
[1] Russian Acad Sci, VA Trapeznikov Inst Control Sci, Profsoyuznaya Str 65, Moscow, Russia
[2] Lomonosov Moscow State Univ, Leninskie Gory Str 1-2, Moscow, Russia
[3] Natl Res Univ Higher Sch Econ, Myasnitskaya Str 20, Moscow, Russia
[4] Moscow Inst Phys & Technol, Inst Lane 9, Dolgoprudnyi, Moscow Region, Russia
基金
俄罗斯基础研究基金会;
关键词
Maintenance; Scheduling; Dynamic programming; Constraint programming; Heuristic; SEARCH;
D O I
10.1007/978-3-030-38603-0_23
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this article, we consider the problem of planning maintenance operations at a locomotive maintenance depot. There are three types of tracks at the depot: buffer tracks, access tracks and service tracks. A depot consists of up to one buffer track and a number of access tracks, each of them ending with one service track. Each of these tracks has a limited capacity measured in locomotive sections. We present a constraint programming model and a greedy algorithm for solving the problem of planning maintenance operations. Using lifelike data based on the operation of several locomotive maintenance depots in Eastern polygon of Russian Railways, we carry out numerical experiments to compare the presented approaches.
引用
收藏
页码:311 / 325
页数:15
相关论文
共 50 条