求解机场终端区飞机着陆调度问题的遗传算法-计算机工程与应用.PDF

Computer Engineering and Applications 计算机工程与应用 2012 ，48 （12） 229 求解机场终端区飞机着陆调度问题的遗传算法 张 伟，王 宏 ZHANG Wei, WANG Hong 天津大学 理学院，天津 300072 School of Science, Tianjin University, Tianjin 300072, China ZHANG Wei, WANG Hong. Genetic algorithm on scheduling aircraft landing in aircraft terminal area. Com- puter Engineering and Applications, 2012, 48 （12）：229-232. Abstract ：The air traffic controller must assign each aircraft to a runway and compute the landing time for each air- craft in the horizon. Based on minimizing the aircraft delay time, an improved method for scheduling aircraft land- ing at an airport with multiple runways is studied. Two constraints are considered. One is the separation time con- straint for the adjacent aircrafts landing on the same runway, and the other is that the landing time lies within a pre- defined time window for each aircraft. A genetic algorithm is developed to resolve this problem. A chromosome con- sists of an aircraft sequencing list and a runway list and the corresponding crossover and mutation operations are al- so designed. As test instances, the standard sets of OR-Library are employed. The computational results show that this algorithm is effective. Key words ：scheduling aircraft landing; multiple runways; time window; genetic algorithm 摘 要：空中管制员需为到达的飞机安排跑道并计算着陆时间，以飞机空中延误最小为出发点研究了多跑道 的飞机着陆调度问题，约束条件为每架飞机的着陆时间应落在规定的时间窗内及相邻两架飞机应满足最小时 间间隔。针对该问题设计了一种遗传算法对问题进行求解，其中染色体由飞机排序链表和跑道链表组成，相 应的交叉和变异算子也做了改进设计。仿真实验用数据库OR-Library 中的实例验证了该算法的有效性。 关键词：飞机着陆调度；多跑道；时间窗；遗传算法 文章编号：1002-8331（2012 ）12-0229-04 文献标识码：A 中图分类号：O223 1 前言 做了很多的研究，Teodorovic 和Guberinic[1]提出了一 随着航空运输量持续迅猛地增长，终端区飞机 个分枝定界方法，使总的旅客延误达到极小。James[2] 着陆调度问题已成为航空公司生产计划的重要组成 提出了四种不同的遗传搜索方法对静态情况下多跑 部分。该问题是按照一定的限制条件为同时到达的 道飞机排序问题进行测试，并取得了较好的结果。 每一架飞机分配跑道并计算着陆时间，限制条件包 Pinol 和Beasley[3]讨论了带有时间窗的多跑道飞机着 括：机型、飞速、风速、突发状况等。