Railroad traffic control

Solving traffic management problems via existing methods of optimization theory is rather difficult. Problems with the construction of an appropriate model arise from the lack of clear wishes of customers and the complexity of the formalization of the problem. In addition, the scale of formalized problems is quite large, especially for major transport companies.

In 2014, following results were obtained.

  • Freight wagons fleet management

An approach based on column-generation method is proposed. Large-scales practical problems (up to 10 million arcs in the graph) have have been solved using this approach for a few minutes on the computer with a processor Intel Xeon X5460 3.16 GHz.

  • Minimization of maximum weighted lateness 

For the problem of two stations connected by a double-track railway polynomial dynamic programming algorithm is proposed. Agorithm finds the solution of problem of the formation and departure of trains taking into account the various constraints.

  • Operational management of trains during the repair work on the double-track railway

For the problem of finding a schedule for the double-track railway provided that one of the sections between semaphores closed exact algorithm based on dynamic programming method is proposed.

  • Train control on the single-track railway section with spare deadlock branches

For the problem of minimizing the total time of arrival of trains in the case of simultaneous release dates of trains and one deadlock branch exact algorithm is proposed. The complexity of algorithm equals O (1) operations.

Copyright © 2012 ORSOT, Powered by warp