摘要
以深度优先搜索的隐枚举算法为基础,结合MPS约束、位置冻结限制、移动时间窗限制和其他多项约束,使用复杂的软件编码实现了特定于飞机着陆调度问题的优化排序算法。对比研究了全局优化、带移动时间窗的局部优化以及一种启发式算法。结果表明,后两种算法可以很好地达到现实空管应用中的实时性要求。可应用于多种目标函数的动态实时ATC自动化系统中,能有效地减小交通延误和提高着陆容量。
This paper presents an efficient optimization algorithm for airciraft landing scheduling problem, based on depth-first-search implicit emumeration algorithm, subject to MPS limiting, position lock limiting, moving time-window and other ATC restrictions. Three algorithm results are compared: Globe optimization, local optimization with moving time window and a heuristic one. It shows that the later two can satisfy the real-time compution demand in real world ATC enviroment very well. This algorithm can apply to dynamic ATC automation system with flexible goal cost function, and can efficiently minimize traffic delay and improve landing capacity.
出处
《系统工程理论方法应用》
2004年第2期182-186,共5页
Systems Engineering Theory·Methodology·Applications
基金
民航总局科研项目(2002-6)
关键词
隐枚举算法
空中交通流量管理
移动时间窗
飞机着陆
空中调度
implicit emumeration algorithm
air traffic flow management
travelling sales man problem
ATC automation system
