Korean Journal of Construction Engineering and Management (한국건설관리학회논문집)

Korea Institute of Construction Engineering and Management (한국건설관리학회)
권호 표지
DOI QR코드

DOI QR Code

A Study on the Generation of Crew Scheduling Diagram Using Neighborhood Search Method for Improving Railway Operation Management

철도 운영관리 효율화를 위한 이웃해 탐색기법을 사용한 승무다이아 생성방안

  • Lee, Jaehee (Department of Civil Engineering, Gyeongsang National University) ;
  • Park, Sangmi (Department of Civil Engineering, Gyeongsang National University) ;
  • Kang, Leenseok (ERI, Department of Civil Engineering, Gyeongsang National University)
  • Received : 2019.05.27
  • Accepted : 2019.07.19
  • Published : 2019.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

The train operation institution establishes a transportation plan based on the forecast of transport demand and the ability of train vehicles to transport, and establishes a train operation plan accordingly. The train operation plan adjusts the intervals between trains, creates a timetable (train diagram) for trains, and establishes a plan for the operation of train vehicles used for train operation. The train operation institution shall establish a crew schedule to determine and place the crew members of the trains arranged in the diagram in order to enhance the efficiency of the operation management of the trains. In this study, the authors apply the neighborhood search method that satisfies the constraints at the phase of generating the crew diagram. This suggests a methodology for efficient management of crew schedule plan. The crew diagram generated in this study compared with the existing crew diagram in accordance with the actual operating train timetable, and verified the effectiveness of the suggested method.

철도운영기관은 수송수요예측과 열차차량의 수송능력을 토대로 수송계획을 세우고 이에 따른 열차운행계획을 수립한다. 열차운행계획을 통해 열차 운행간격이 조정되어 열차운행시간표(열차다이아)가 작성되고, 열차운행에 사용되는 열차의 차량운영계획이 수립된다. 열차운영기관에서는 열차 운영관리의 효율성을 높이기 위해 다이아에 편성되어진 열차들의 승무인원을 판단하고 배치하는 승무일정계획을 수립해야 한다. 본 연구에서는 승무일정계획 문제인 승무다이아 작성단계에 제약조건을 만족하는 이웃해 탐색기법을 적용하여 승무 계획의 효율적 관리가 가능하도록 하는 방법론을 제시한다. 연구에서 제시한 방법론에 의해 생성된 승무 다이아는 실제 운영하는 열차시간표를 대상으로 기존 승무다이아와 결과 값을 비교하여 제시된 방법론의 효율성을 검증하였다.

Keywords

References

  1. Ernst, A., Jiang, H., Krishnamoorthy, M., Nott, H., and Sier, D. (2001). "Rail Crew Scheduling and Rostering Optimization Algorithms." Computer-Aided Scheduling of Public Transport : Part of the Lecture Note in Economics and Mathematical Systems, 505, pp. 53-71.
  2. Heo, N.I. (2000). "A Crew Scheduling Using Set Partitioning." Dep, of Management Information Systems, Graduate School, Dong-A Univ, Pusan, Korea.
  3. Hwang, J.H., and Ryu, K.R. (2004). "A Hybrid of Neighborhood Search and Integer Programming for Crew Schedule Optimization." Journal of Korea Information Science Society : Software and Applications, KISS, 31(6), pp. 829-839.
  4. Hwang, J,H., Park, C.H., Lee, Y.H., and Ryu, K.R. (2002). "Crew Schedule Optimization by Integrating Integer Programming and Heuristic Search." Journal of Korea Information Science Society : Computing Practices and Letters, KISS, 8(2), pp. 195-205.
  5. Hwang, J.H. (2014). "An Integer Programming-based Local Search for the Set Covering Problem." Journal of the Korea Society of Computer and Information, KSCI, 19(10), pp. 13-21. https://doi.org/10.9708/jksci.2014.19.10.013
  6. Khmeleva, E., Hopgood, A.A. Tipi, L., and Shahidan, M. (2014). "Rail-Freight Crew Scheduling with a Genetic Algorithm." Research and Development in Intelligent Systems 31, pp. 211-223.
  7. Khosavi, A., Tamannaei, M., and Reisi-Nafchi, M. (2016). "A Comprehensive Approach for Railway Crew Scheduling Problem (Case Study : Iranian Railway Network.)" International Journal of Transportation Engineering, IJTE, 4(3), pp. 197-210.
  8. Kim, T.S., Park, K.Y., Park, T.J., and Ryu, K.R. (2011). "Candidate Dia Creation Methods for Subway Crew Scheduling." Journal of Korea Information Science Society, KISS, 38(1C), pp. 299-302.
  9. Lee, D.H., Yang, T.Y., and Kim, Y.H. (2006). "A Study on Korean Railroad Crew Rostering Problem." Journal of the Korean Society for Railway, 9(2), pp. 206-211.
  10. Park, C.H. (2000). "Heuristic Repair Methods for Improving Subway Crew Scheduling." Dep. of Computer Engineering, Graduate School, Pusan National Univ, Pusan, Korea.
  11. Tormos, P., Lova, A., Barber, F., Ingolotti, L., Abril, M., and Salido, M.A. (2008). "A Genetic Algorithm for Railway Scheduling Problems." Metaheuristics for Scheduling in Industrial and Manufacturing Applications : Part of the Studies in Computational Intelligence, 128, pp. 255-276.
  12. Yang, J.Y., and Jo, G.S. (1998). "Knowledge-Based vs. Constraints-Based Scheduling : A Case study of Gate Allocation Problem." Journal of expert systems, 4(2), pp. 45-59.