단선구간 열차경합해소 문제를 위한 수리계획 모형의 기본설계

초록

This paper is designed to help train dispatcher resolve railway conflicts in real-time. We developed a mixed integer programming model to optimize the train schedule that determines the best overtaking or crossing positions. The objective of the model is to minimize the maximum lateness of the trains and reduce the total sum of the lateness, while satisfying the field constraints associated with the difference between passenger trains and freight trains, and the limited number of sidings. We applied the model on a portion of a single line track, Joong-Ang Line to ascertain the efficiency of the model, and showed how the model can be used to resolve the railway conflicts. The results indicates that our model can provide useful results in terms of optimal schedule for the test problem. This type of modeling approach would be useful for a train dispatcher to make a real-time railway conflict resolution.

키워드