第1筆 /總和 1 筆
/ 1 筆
頁籤選單縮合
題名 | 空服員排班組合最佳化之研究=Optimization of Airline Crew Pairings |
---|---|
作 者 | 顏上堯; 林錦翌; | 書刊名 | 中國土木水利工程學刊 |
卷期 | 9:2 1997.06[民86.06] |
頁次 | 頁303-313 |
分類號 | 494.542 |
關鍵詞 | 空服員排班; 可行值勤航班組合; 變數產生法; 集合涵蓋問題; 最短路徑問題; Crew scheduling; Pairing; Column generation; Set covering problem; Shortest path problem; |
語文 | 中文(Chinese) |
中文摘要 | 實務上空服員排班間問題甚為複雜,不僅須滿足航空公司所規劃的班次表及機隊 排程,且須遵守民航法規、工會之工作限制,以及公司本身內部之人事管理原則等複雜因素 ,故當航空公司的規模擴大時,甚難以人工的方式做有效的規劃,本研究發展一空服員排班 組合最佳化模式,並利用變數產生方法求解此模式。數學上此模式可構建為兩個問題,主問 題為一集合涵蓋問題, 次問題為一最短路徑問題。 本研究利用單體法, 及 label correcting algorithm 分別求解主問題及次問題, 以產生一組最小成本之可行值勤航班組 合。為測試模式效果,本研究進行一實例分析,效果良好。 |
英文摘要 | Because a feasible crew schedule has to satisfy the drafted flight sch edule, agreement with labor unions, and the government regulations, the crew scheduling is complicated. The problem is difficult to solve efficiently by hand, particularly for large-scale ones. This paper proposes a systematic model and an efficient solution algorithm to minimize crew cost and plan proper crew pairings under the real constraints. A column generation approach is developed to solve the crew scheduling problem for a major airline carrier in Taiwan. The column generation approach decomposes the problem into two parts; the major problem and the subproblem. The former is formulated as a set covering problem that can be solved using the simplex method. The latter is formulated as a short est path problem that can be solved using the label correcting algorithm. The sh ow the applicability of the model, a case study has been performed. The results are good. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。