COORDINATION OF LOCOMOTIVES TURNOVER AND SERVICING MODES

Abstract

A coordinated calculation of two processes – locomotives turnover and servicing – is described. Locomotives turnover is calculated by optimization system Labyrinth and servicing by dynamic transportation problem. Service programs integrate these processes. A model of coordinated arrival of locomotives at servicing stations is proposed. The calculation consists of three interrelated steps. The first step is the calculation of the optimal locomotive turnover without considering servicing constraints. Service program SP-1 determines stations where forced stops will take place according to the necessity of servicing and forms the basic location of locomotives for further movement to servicing stations. The second step is the calculation of the optimal arrival of locomotives at servicing stations. Service program SP-2 provides location and release time of each locomotive after servicing. The third step is the calculation of a train schedule with the consideration for the location of stopped train sets and the appearance of locomotives after servicing. Servicing program SP-3 forms the united results.

Keywords

• locomotive turnover
• train flow
• optimization
• dynamic transportation problem