.png){kind=icon}
返回
Aircrew schedule generation using repeated matching
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(96)00225-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the Aircrew Scheduling Problem of determining tours of duty (TODs) for aircrews, given a set of sectors (or flights) requiring regular crews. A regular crew consists of two crew members, but by including supplementary crew (a third pilot) on some sectors it is possible to extend duty periods to generate more cost efficient TODs. A related problem is thus to generate TODs for these third pilots, but the sectors requiring a third pilot are not known in advance. To solve these two related problems simultaneously, we apply a heuristic procedure that solves a sequence of matching problems, i.e. a repeated matching algorithm. Numerical results based on the solution of a real problem show that this approach is a valid and efficient method for solving the Aircrew Scheduling Problem, especially when there is the option of using supplementary crew to extend duty periods. (C) 1997 Elsevier Science B.V.
Keyword:
crew scheduling
supplementary crew
matching
heuristic
optimisation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容