| 飞机着陆调度排序算法的设计与实现 |
| |
| 引用本文： | 冯兴杰,黄亚楼.飞机着陆调度排序算法的设计与实现[J].计算机工程,2004,30(10):160-162. |
| |
| 作者姓名： | 冯兴杰 黄亚楼 |
| |
| 作者单位： | 1. 南开大学软件学院,天津,300071;中国民航学院计算机科学与技术学院,天津,300300
2. 南开大学软件学院,天津,300071 |
| |
| 基金项目： | 教育部科学技术研究重点资助项目(020038) |
| |
| 摘 要： | 航空管制员必须为同时到达的每一架飞机计算着陆时间，使整体费用最小，同时还要注意一些硬性的限制条件。在某一时刻，给定管制员视野内的飞机数量，可以公式化为约束最优化问题，从而应用一定的算法来解决。该文提出了基于分枝定界的飞机着陆调度排序算法——ASAL，实验证明通过该算法能够很好地解决飞机着陆调度优化问题。
|
| 关 键 词： | 飞机着陆调度 最优化问题 分枝定界 |
| 文章编号： | 1000-3428(2004)10-0160-03 |
Design and Implementation of Algorithm on Scheduling Aircraft Landing |
| |
| FENG Xingjie,HUANG Yalou.Design and Implementation of Algorithm on Scheduling Aircraft Landing[J].Computer Engineering,2004,30(10):160-162. |
| |
| Authors: | FENG Xingjie HUANG Yalou |
| |
| Affiliation: | FENG Xingjie1,2,HUANG Yalou1 |
| |
| Abstract: | The air traffic controller must compute a landing time for each aircraft in the horizon, and must attempt to minimize costs while observing a number of hard constraints.To give a certain number of aircraft within the air traffic controllers' horizon at a certain point in time, this problem can be formulated as a optimization problem and develop some algorithm for its solution. The paper presents an algorithm of scheduling aircraft landing time based on branch and bound(ASAL). Experiments show the proposed method is good at solving the problem of scheduling aircraft landing time. |
| |
| Keywords: | Schedules for landing aircraft Optimization problem Branch and bound |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
