基于均衡使用要求的飞机排班算法
Tail-Number-Assignment Problem of Airliners Based on Fleet Balance Application
-
摘要: 为解决基于均衡使用要求的飞机排班问题,引入航班节的概念,并对飞机-航班节之间的匹配性约束作 松弛处理,然后通过构造航班节的网络模型,将基于飞机均衡使用要求的飞机排班问题转化为寻找一个使目标 函数最小的航班节编组方案问题.根据飞机的均衡使用要求构造了目标函数.设计了一种基于模拟退火算法的 启发式算法。该算法的计算复杂性为O(M(m3+mn)).Abstract: To solve airliner tail-number-assignment (TNA) problem with the requirement of balanced application of airplanes, a simulated annealing algorithmwas 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 pairnetworkmodel describingthe connectingrelationship of flight pairs, the originalTNAproblem is transformed to optimizing flight pair schemes with minimized target function. A simulated annealing algorithmwas presented. The computing complexity of this algorithm isO(M(m3+mn)).
点击查看大图
计量
- 文章访问数: 1406
- HTML全文浏览量: 58
- PDF下载量: 144
- 被引次数: 0