Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)
- Volume 13 Issue 21
- /
- Pages.111-117
- /
- 1990
- /
- 2005-0461(pISSN)
- /
- 2287-7975(eISSN)
Maximal-Flow-Problem with transit priority in a track
통과 우선순위가 있는 선로의 최대 흐름문제
Abstract
This paper treats the problem to schedule for train with low transit priority so as to maximizing the number that can be sent during given time without interfering with the fixed schedule for train with high transit priority in a track. We transform the this problem into Time-Expanded Network without traverse time through application of Ford-Fulkerson Model, develop a TENET GENerator(TENETGEN) and obtain the data of TENET using developed TENETGEN. Finally, we seek the optimal solution to these data with Dinic's Maximal-Flow Algorithm and examine the availability of our procedures in personal computer.
Keywords