摘要
通过对大型机场机位分配所受约束和最终目标的分析研究,将其模型化,提出使用遗传算法来解决机场机位分配问题,并设计实现了该算法。为促进算法收敛,引入模拟退火思想对适应度函数进行了修正。实验数据表明,该算法相对已有的其它机位分配方法在计算 时间、实时性和结果优化程度上都有一定的优势。目前该方法已经成功应用到国内某国际机场。
After analyzing the constraints and objective of general airport parking-position assignment problem, a model is put forward. Using this model, the paper proposes and implements a strategy based on genetic algorithm to solve the problem. In order to accelerate the converging speed of this algorithm, an idea of simulated annealing is introduced to revise fitness function value. Experimental results show that the algorithm has advantages including computation time, real time performance and optimization over other existed algorithms. This strategy has been successfully applied in an international airport.
出处
《计算机工程》
EI
CAS
CSCD
北大核心
2005年第3期186-188,228,共4页
Computer Engineering
关键词
遗传算法
机场
机位分配
模拟退火修正
CSP
Genetic algorithm(GA)
Airport parking-position assignment