철도 승무원 교번표의 운행 사업 배치 문제에 관한 연구

초록

This thesis presents railroad crew rostering problem, which is to determine the railroad plan allocation. This problem is constructed that determine the sequence of duties that railroad crews have to perform. We analyze characteristic of this problem and railroad industry. It's hard to consider many constraint conditions. We propose Integer Programming model and easy methodology to be considered all given operation rules. This problem is known to be NP-hard. We develop a genetic algorithm, which is proved to be powerful in solving optimization problems. We proposed the effective mathematical model and algorithm about making crew rostering in real industry.

키워드