期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 38, 期 5, 页码 5787-5793出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2010.10.053
关键词
Ant colony optimization (ACO); Airline crew scheduling; Swarm intelligence; Combinatorial optimization problem
Airline crew scheduling is an NP-hard constrained combinatorial optimization problem, and an effective crew scheduling system is essential for reducing operating costs in the airline industry. Ant colony optimization algorithm (ACO) has successfully applied to solve many difficult and classical optimization problems especially on traveling salesman problems (TSP). Therefore, this paper formulated airline crew scheduling problem as Traveling Salesman Problem and then introduce ant colony optimization algorithm to solve it. Performance was evaluated by performing computational tests regarding real cases as the test problems. The results showed that ACO-based algorithm can be potential technique for airline crew scheduling. (C) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据