A study on a mathematical model of the track maintenance scheduling problem

This paper presents a mathematical model of the long-term track tamping scheduling problem in the Korean high-speed railway system. The presented model encompasses various operational field constraints and moreover improves a state-of-the-art model in extending the feasible space. We show the model is sized up to intractable scale, then propose another approximation model that can be handled with the present computer system and commercial optimization package directly. The aggregated index, lot, is selected, considering the resolution of the planning horizon as well as the scheduling purpose. Lastly, this paper presents two test results for the approximation model. The results show the approximation model to be quite promising for deployment into an operational software program for the long-term track tamping scheduling problem.