| Weekly Fleet Assignment Model and Algorithm |
| |
| 作者姓名： | 朱星辉 朱金福 巩在武 |
| |
| 作者单位： | College of Civil Aviation Nanjing University of Aeronautics and Astronautics，College of Civil Aviation，Nanjing University of Aeronautics and Astronautics，College of Civil Aviation，Nanjing University of Aeronautics and Astronautics，Nanjing 210016，China，Nanjing 210016，China，Nanjing 210016，China |
| |
| 基金项目： | Foundation item The National Natural Science Foundation of China （70473037） |
| |
| 摘 要： | A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity, and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a real-world case study on an airline with 5 fleets, 48 aircrafts and 1786 flight legs indicated that the profit increase was $1591276 one week and the running time was no more than 4 min, which shows that the model and algorithm are fairly good for domestic airline.
|
| 关 键 词： | 飞行调度 快速赋值问题 分支跳跃算法 线性网络 |
| 文章编号： | 1005-2429（2007）03-0231-05 |
| 修稿时间： | 2006-09-12 |
Weekly Fleet Assignment Model and Algorithm |
| |
| ZHU Xing-hui,ZHU Jin-fu,GONG Zai-wu.Weekly Fleet Assignment Model and Algorithm[J].Journal of Southwest Jiaotong University,2007,15(3):231-235. |
| |
| Authors: | ZHU Xing-hui ZHU Jin-fu GONG Zai-wu |
| |
| Institution: | College of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China |
| |
| Abstract: | A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity,and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a realworld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was $1591276 one week and the running time was no more than 4 min, which shows that the model and algorithm are fairly good for domestic airline. |
| |
| Keywords: | Flight scheduling Fleet assignment problem 0-1 Integer programming model Branch-and-bound algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
