交通运输系统工程与信息 ›› 2008, Vol. 8 ›› Issue (1): 138-143 .

• 案例分析 • 上一篇    下一篇

基于GSAA的停机位指派优化问题的研究

鞠姝妹;许俐*   

  1. 南京航空航天大学 民航学院 南京 210016
  • 收稿日期:2007-08-24 修回日期:2007-11-16 出版日期:2008-02-25 发布日期:2008-02-25
  • 通讯作者: 许俐
  • 作者简介:鞠妹妹(1984-),女,江苏淮安市人,硕士生.
  • 基金资助:

    民航总局软科学基金项目(MHRD0622).

Airport Gate Assignment Problems Based on GSAA

JU Shu-mei;XU Li   

  1. School of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
  • Received:2007-08-24 Revised:2007-11-16 Online:2008-02-25 Published:2008-02-25
  • Contact: XU Li

摘要: 停机位的合理指派是机场地面作业中的一项核心任务,对减少枢纽机场航班中转时间起着重要作用,但是停机位指派问题是NP难问题,模型和算法都比较复杂。建立了以旅客满意度为优化目标的数学模型,并设计了一种贪婪模拟退火算法(GSAA),以求解枢纽机场的停机位指派问题。该算法首先根据贪婪算法FCFS准则使“丢失”的航班数最少得到模拟退火算法的初始解,然后运用经典模拟退火算法求解出最优指派结果。数值仿真证明了模型和算法的有效性。

关键词: 枢纽机场, 停机位指派, 旅客满意度, 贪婪模拟退火算法

Abstract: Airport gate assignment is a key task among the airport ground work which is important to reduce transfer time in hub airports. However, the gate assignment problem (GAP) is an NP-hard problem, and its models and algorithms are complex. This paper proposes a model and a new greedy simulated annealing algorithm (GSAA) to resolve the GAP. The initial solution of the proposed algorithm is obtained through FCFS criterion of greedy method to minimize the “dropping” flights, and then the optimal solution is obtained through the traditional simulated annealing algorithm. Simulation result shows the validity of the model and the algorithm.

Key words: hub airport, gate assignment problem, the degree of passenger satisfaction, greedy simulated annealing algorithm

中图分类号: