| 基于均衡使用要求的飞机排班算法 |
| |
| 引用本文： | 孙宏,文军,徐杰.基于均衡使用要求的飞机排班算法[J].西南交通大学学报,2004,39(5):569-572. |
| |
| 作者姓名： | 孙宏 文军 徐杰 |
| |
| 作者单位： | 1. 中国民航飞行学院空中交通管理学院,四川,广汉,618307
2. 铁道科学研究院电子所,北京,100081 |
| |
| 基金项目： | 国家自然科学基金资助项目(60472129)，中国民航科研基金资助项目(2000-18) |
| |
| 摘 要： | 为解决基于均衡使用要求的飞机排班问题，引入航班节的概念，并对飞机一航班节之间的匹配性约束作松弛处理，然后通过构造航班节的网络模型，将基于飞机均衡使用要求的飞机排班问题转化为寻找一个使目标函数最小的航班节编组方案问题，根据飞机的均衡使用要求构造了目标函数，设计了一种基于模拟退火算法的启发式算法。该算法的计算复杂性为O(M(m^3 mn))。
|
| 关 键 词： | 建立模型 飞机排班 机队使用均衡 航班节 网络 模拟退火算法 计算复杂性 |
| 文章编号： | 0258-2724(2004)05-0569-04 |
Tail-Number-Assignment Problem of Airliners Based on Fleet Balance Application |
| |
| SUN Hong,WEN Jun,XU Jie.Tail-Number-Assignment Problem of Airliners Based on Fleet Balance Application[J].Journal of Southwest Jiaotong University,2004,39(5):569-572. |
| |
| Authors: | SUN Hong WEN Jun XU Jie |
| |
| Institution: | SUN Hong~1,WEN Jun~1,XU Jie~2 |
| |
| Abstract: | To solve airliner tail-number-assignment (TNA) problem with the requirement of balanced application of airplanes, a simulated annealing algorithm was designed. According to the character of single hub and spoke network widely used in Chinese airliners, a new concept called flight pairing was defined. When sufficient aircrafts are available, constraint on application of each aircraft is ignored. By constructing a flight pair network model describing the connecting relationship of flight pairs, the original TNA problem is transformed to optimizing flight pair schemes with minimized target function. A simulated annealing algorithm was presented. The computing complexity of this algorithm is O(M(m~3 mn)). |
| |
| Keywords: | modeling tail-number-assignment fleet balance application flight pair network simulated annealing algorithm computing complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
