RUS  ENG
Full version
JOURNALS // Problemy Upravleniya // Archive

Probl. Upr., 2013 Issue 1, Pages 50–56 (Mi pu764)

Control in the socio-economic systems

Optimal planning of renovation of railway line: formulation, algorithms for solving

Yu. O. Petrovetsab, D. L. Andrianovab

a Perm State National Research University
b PROGNOZ

Abstract: The paper presents the long-term optimal control problem arising in planning of railway infrastructure renewal. The paper also considers the method of solving based on the idea of branch and bound algorithm using dynamic programming approach to obtain bounds.

Keywords: railway infrastructure; optimal planning; brunch and bound algorithm; dynamic programming.

UDC: 330.4



© Steklov Math. Inst. of RAS, 2026