The key to solving the race conflict problem is that you need to find a train profile of viable trains, that is, a schedule of integrated trains, in a sufficiently short time, while maintaining safe seizure. In the previous research, we proposed a two-step solution through partitioning and deconstruction of the problem and discretization of the path. However, this method has a limitation in that it cannot be applied only at the nodal point. In this study, we tried to obtain a train schedule that considers the safety profile and considers the more secure and microscopic viewpoint by overcoming the limitation of the existing model by continuously considering the speed profile without disassembling the problem. To do this, we propose a method of modeling the detailed schedule decision step as a continuous variable in the existing twostep solution and approximate the calculation based on several functions.

• 박중제(서울대학교 산업공학과 경영과학/최적화 연구실, Seoul National University IE Department Management Science/Optimization Lab) | Joong Je Park