期刊
COMPUTERS & OPERATIONS RESEARCH
卷 137, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2021.105551
关键词
Mixed-integer programming; Compact formulation; Robustness; Proximity search
类别
资金
- Research Council of Norway
This study addresses an integrated airline scheduling problem by combining fleet assignment, aircraft routing, and crew pairing. The proposed approach emphasizes robustness by restricting tight connections and increasing the number of connections where crews follow the aircraft, showing an average deviation of at most 0.6% from a conservative bound in real instances.
We address an integrated airline scheduling problem that combines three airline planning processes: fleet assignment, aircraft routing, and crew pairing. For a given daily flight schedule, the problem requires simultaneously assigning aircraft and crews to each scheduled flight, taking into account aircraft maintenance restrictions and crew work rules. We propose to solve this complex problem of integrated flight planning while taking into account robustness considerations. In this regard, robustness is achieved by restricting tight connections in the schedule and increasing the number of connections where crews follow the aircraft. We formulate the problem using a very large-scale, yet compact, mixed-integer programming model, and we propose a matheuristic consisting of a decomposition approach and a proximity search algorithm. Computational experiments carried out on real instances from a major airline and having up to 14,014 itineraries, 646 flights, and 202 aircraft provide evidence of the proposed approach's efficacy. In particular, we find that the average deviation from a conservative bound is at most equal to 0.6%.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据