• Title/Summary/Keyword: 승무일정계획

Search Result 5, Processing Time 0.017 seconds

Candidate Dia Creation Methods for Subway Crew Scheduling (지하철 승무일정계획 수립을 위한 후보 다이아 생성 방안)

  • Kim, Tae-Sung;Park, Ki-Yeok;Park, Tae-Jin;Ryu, Kwang-Ryel
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06c
    • /
    • pp.299-302
    • /
    • 2011
  • 승무일정계획이란 특정 기간 동안 운행할 차량들을 대상으로 각 차량마다 필요로 하는 승무원을 배정하는 계획을 말한다. 최적 승무일정계획의 수립은 일반적으로 제약 조건을 만족하는 모든 종류의 개별 다이아를 생성한 다음 이들을 대상으로 모든 차량을 운행할 수 있는 최적조합을 선정하는 방식으로 이루어지고 있다. 승무일정계획 문제의 난이도는 제약 내의 개별 다이아 생성하는 단계에서 생성되는 후보다이아 집합에 많은 영향을 받는다. 본 논문에서는 승무일정계획 문제의 난이도를 줄일 수 있는 후보다이아 집합을 생성하기 위한 방안 2가지를 제시한다. 실제 현장의 승무일정계획 문제를 대상으로 한 실험 결과, 방안들을 적용한 경우에 기존의 방법으로는 수립하기 어려웠던 계획을 빠른 시간 내에 수립할 수 있음을 확인하였다.

A Hybrid of Neighborhood Search and Integer Programming for Crew Schedule Optimization (승무일정계획의 최적화를 위한 이웃해 탐색 기법과 정수계획법의 결합)

  • 황준하;류광렬
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.6
    • /
    • pp.829-839
    • /
    • 2004
  • Methods based on integer programming have been shown to be very effective in solving various crew pairing optimization problems. However, their applicability is limited to problems with linear constraints and objective functions. Also, those methods often require an unacceptable amount of time and/or memory resources given problems of larger scale. Heuristic methods such as neighborhood search, on the other hand, can handle large-scaled problems without too much difficulty and can be applied to problems having any form of objective functions and constraints. However, neighborhood search often gets stuck at local optima when faced with complex search spaces. This paper presents ,i hybrid algorithm of neighborhood search and integer programming, which nicely combines the advantages of both methods. The hybrid algorithm has been successfully tested on a large-scaled crew pairing optimization problem for a real subway line.

A Study on the Generation of Crew Scheduling Diagram Using Neighborhood Search Method for Improving Railway Operation Management (철도 운영관리 효율화를 위한 이웃해 탐색기법을 사용한 승무다이아 생성방안)

  • Lee, Jaehee;Park, Sangmi;Kang, Leenseok
    • Korean Journal of Construction Engineering and Management
    • /
    • v.20 no.5
    • /
    • pp.42-51
    • /
    • 2019
  • 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.

Crew Schedule Optimization by Integrating Integer Programming and Heuristic Search (정수계획법과 휴리스틱 탐색기법의 결합에 의한 승무일정계획의 최적화)

  • Hwang, Jun-Ha;Park, Choon-Hee;Lee, Yong-Hwan;Ryu, Kwang-Ryel
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.2
    • /
    • pp.195-205
    • /
    • 2002
  • Crew scheduling is the problem of pairing crews with each of the vehicles in operation during a certain period of time. A typical procedure of crew schedule optimization consists of enumerating all possible pairings and then selecting the subset which can cover all the operating vehicles, with the goal of minimizing the number of pairings in the subset. The linear programming approach popularly adopted for optimal selection of pairings, however, is not applicable when the objective function cannot be expressed in a linear form. This paper proposes a method of integrating integer programming and heuristic search to solve difficult crew scheduling problems in which the objective function cannot be expressed in linear form and at the same time the number of crews available is limited. The role of heuristic search is to improve the incomplete solution generated by integer programming through iterative repair. Experimental results show that our method outperforms human experts in terms of both solution quality and execution time when applied to real world crew scheduling Problems which can hardly be solved by traditional methods.

Cockpit Crew Scheduling using Set Partitioning Problem (집합분할모형을 이용한 운항승무원의 승무경로 일정계획)

  • 김국연;이영훈
    • Korean Management Science Review
    • /
    • v.21 no.1
    • /
    • pp.39-55
    • /
    • 2004
  • Efficient crew scheduling for cockpit crew is important in airline industry due to operational safety and cost associated with the flight duty time. Because of complexity of regulations imposed to the cockpit crew. it is complicated to generate an efficient schedule. Schedule of cockpit crew can be generated through two steps; selecting of flight patterns. and scheduling of them to the specific time horizon. Heuristic method is developed and applied with massive data in a limited time of computation. A set of flight patterns is selected from all possible flight patterns. which are generated by composing the flight leg based on regulations. by using the set partitioning problem with objective function of oversea stay cost. The selected set of flight patterns found at the first step is allocated to 4 week crew schedule to minimize the variance of total fight time assigned to each crew. The crew schedules obtained are evaluated and compared with the ones currently used in one of major airline company.