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.