A Study on a Mathematical Model of 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, 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 is possible to handle 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 scheduling purpose. Lastly, this paper presents two test results for the approximation model. The results expose the approximation model to quite promising in deploying it into an operational software program for the long-term track tamping scheduling problem.