• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.153-156
• /
• 2000

철도 승무원 교번표는 승무사업이 작성된 이후 순서규칙(sequencing rule), 운영규칙 등과 같은 제약조건을 만족하는 사업(duty)의 진행 내용을 나타내고 있는 표이다. 일반적으로 철도 승무원 교번표 작성은 승무원 사업표가 작성된 후 각 사업소 별로 승무원간 사업시간의 차이가 최소가 되도록 즉, 승무원이 균등한 사업시간을 갖도록 작성이 된다. 교번표의 작성은 각 나라마다 독특한 노동협약이나 운용규정 등과 같은 복잡한 제약조건들을 충분히 고려하여 작성되어야 하므로 그 동안 연구에 어려움이 많았다. 본 연구에서는 우리나라 철도청에서 현재 수행하고 있는 교번표 작성현황을 살펴보고 문제점을 파악하였다. 또한 교번표 작성 절차를 분석하여 모형화 하였으며 추후 연구방향을 제시하였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.9
• /
• pp.133-141
• /
• 2019

Crew rostering in railway operations is usually done by arranging a crew diagram in accordance with working standards every month. This study was done to identify the problems related to the creation of crew rosters in railway operations and to suggest an optimum crew rostering method that can be applied in railway operations planning. To do this, the work standards of a railway company were identified, and a genetic algorithm was used to develop an optimal roster with equal working time while considering actual working patterns. The optimization process is composed of analysis of the input data, creation of work patterns, creation of a solution, and optimization steps. To verify the method, the roster derived from the proposed process was compared with a manually created roster. The results of the study could be used to reduce the deviation of business hours when generating a roster because the standard deviation of working time is the objective function.

• Journal of the Korean Society for Railway
• /
• v.9 no.2 s.33
• /
• pp.206-211
• /
• 2006

This thesis presents railroad crew restoring 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 restoring in real industry.

• Proceedings of the KSR Conference
• /
• 2000.11a
• /
• pp.86-92
• /
• 2000

The crew operation scheduling problem is divided into duty generation and duty allocation. The railway crew roster scheduling(duty allocation) is developed monthly for each crew's office, considering the car types and crew's driving ability. However, it is very difficult to make schedules which assign monthly working hours to each crew evenly. The purpose of this thesis is to minimize the differences between each crew's total duty times and make a rostering table. To minimize the differences among monthly working hours of each crews are grouped according to car type and crew's driving ability and a rostering table which could be shared by the group members is developed. Our approach is to apply the techniques of Constraint Programming in order to solve such problems efficiently. This algorithm is suitable to solve optimization problems which involve many complicated constraints. And including the concept of cost, we suggested the model which enable to make the rostering table with a minimum personnel.