Development of Time-Expanded Network using Hold-over Arcs

지체호를 사용하는 시간 전개형 네트워크의 개발

The problem of scheduling the passage things with low transit priority to maximize the amonnt that can be sent during given time periods without interfering with the fixed schedule for passage things with high transit priority in a track, is treated in this paper. The problem is transformed into the Time Expanded Network without traverse time through the Ford and Fulkerson Model and the Enumeration Algorithm is developed for solutions using TENET GENerator(TENETGEN). Finally, the proposed algorithm is compared with Dinic's maximal-flow algorithm and examined for the availability of the procedures on the personal computer.