.png){kind=icon}
返回
Evolutionary algorithms for solving the airline crew pairing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2017.11.022.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Solving the airline crew pairing problem (CPP) requires a search to generate a set of minimum-cost crew pairings covering all flight legs, subject to a set of constraints. We propose a solution comprising two consecutive stages: crew pairing generation, followed by an optimisation stage. First, all legal crew pairings are generated with the given flights, and then the best subset of those pairings with minimal cost are chosen via an optimisation, process based on an evolutionary algorithm. This paper investigates the performance of two previously proposed genetic algorithm (GA) variants, and a memetic algorithm (MA) hybridising GA with hill climbing, for solving the CPP. The empirical results across a set of benchmark real-world instances illustrate that the proposed MA is the best performing approach overall.
Keyword:
Airline crew scheduling
Crew pairing
Set covering
Genetic algorithm
Memetic algorithm
Heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
分享收藏
查看更多内容