摘要
通过分析机场停机位分配的特点,以停机位使用数量最少、航空器在机场滑行距离或时间最短且充分考虑机位均衡利用为目标,建立了机场停机位分配问题的优化模型。应用图论的原理将该问题转化为对图的顶点着色问题,在随机序列启发式搜索求解基础上,设计了基于蚂蚁径路搜索规则的迭代寻优算法,即通过设置邻接矩阵,使每只蚂蚁在可行域内一步步构建有化解,该算法有效地避免了启发式搜索易陷入局部最优的缺陷。最后构造了算例,验证了该模型与算法的合理性。
By analyzing the characteristics of gate assignment in aerodrome, an optimization model of storage for gate assignment was established in this article. Then this problem was converted to graph vertex coloring problem by using graph theory. Based on the idea of sequential heuristic search, this paper proposes a new ant colony optimization algorithm for the classical graph coloring problem to effectively avoid the weakness of easily running into local minimum of heuristic research. Combined with the actual gate assignment in airport, computer simulation is used to approve the feasibility and practicality of the study.
出处
《科技通报》
北大核心
2015年第10期235-238,共4页
Bulletin of Science and Technology
基金
中国民航飞行学院科研项目(J2010-93)
关键词
停机位分配
顶点着色问题
随机序列启发式搜索
蚁群算法
gate assignment
graph vertex coloring problem
sequential heuristic search
ant colony algorithm
