论文部分内容阅读
为克服遗传算法求解多跑道系统到场飞机排序及调度问题时局部搜索能力不强的弱点,建立了该问题的混合整数0-1二次规划模型.通过证明同型飞机在每条跑道上都应按其预计到达该跑道时间的先后顺序依次着陆这一命题,设计了遗传算法与局部优化算法相结合的Memetic算法.算例结果表明:其运行10次的最劣解均不劣于其他遗传算法的最好解,且在5条跑道、20架飞机的情况下,Memetic算法求解时间为0.17 s,与精确算法相比,能满足实时应用需求.
In order to overcome the weakness of the local search ability when the multi-runway system is used to solve the scheduling and scheduling problem of multi-runway system, a mixed integer 0-1 quadratic programming model of the problem is established to prove that the same type of aircraft should be pressed Which is expected to arrive at the runway in order of landing landing proposition, designed genetic algorithm and local optimization algorithm combined Memetic algorithm.Example results show that: the worst of its 10 runs are not inferior to other genetic algorithms The best solution, and in the case of five runways, 20 aircraft, Memetic algorithm solution time is 0.17 s, compared with the exact algorithm to meet the real-time application requirements.