求解机场终端区飞机着陆调度问题的遗传算法  

Genetic algorithm on scheduling aircraft landing in aircraft terminal area

作　　者：张伟[1] 王宏[1] 

机构地区：[1]天津大学理学院,天津300072

出　　处：《计算机工程与应用》2012年第12期229-232,248,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.50906061/E060502)

摘　　要：空中管制员需为到达的飞机安排跑道并计算着陆时间,以飞机空中延误最小为出发点研究了多跑道的飞机着陆调度问题,约束条件为每架飞机的着陆时间应落在规定的时间窗内及相邻两架飞机应满足最小时间间隔。针对该问题设计了一种遗传算法对问题进行求解,其中染色体由飞机排序链表和跑道链表组成,相应的交叉和变异算子也做了改进设计。仿真实验用数据库OR-Library中的实例验证了该算法的有效性。The air traffic controller must assign each aircraft to a runway and compute the landing time for each aircraft in the horizon.Based on minimizing the aircraft delay time,an improved method for scheduling aircraft landing at an airport with multiple runways is studied.Two constraints are considered.One is the separation time constraint for the adjacent aircrafts landing on the same runway,and the other is that the landing time lies within a predefined time window for each aircraft.A genetic algorithm is developed to resolve this problem.A chromosome consists of an aircraft sequencing list and a runway list and the corresponding crossover and mutation operations are also designed.As test instances,the standard sets of OR-Library are employed.The computational results show that this algorithm is effective.

关 键 词：飞机着陆调度 多跑道 时间窗 遗传算法 

分 类 号：O223[理学—运筹学与控制论]