摘要
提出了飞机滑行排序的优化问题,目的是最大限度减少滑行时间,提高机场运行效率。根据飞机在机场地面的运动规律,基于确定的滑行路径,考虑滑行路线冲突,建立了该问题的混合整数规划模型。讨论了该复杂优化问题的分解方法,给出了上海浦东机场地面网络的算例,验证了所做工作的实用性。
The question of optimization for aircraft taxi scheduling was proposed to minimize the time spent in taxiing and to improve tie operation efficiency in airport. According to the aircraft taxi law and the conflicts on taxi routes, a mixed integer linear programming formulation was modelled based on the standard taxi routes. The implementation issue for solving this complex optimization problem was discussed and an instance for Shanghai Pudong Airport was given to demonstrate the significance of the work.
出处
《交通与计算机》
2007年第2期142-145,148,共5页
Computer and Communications
关键词
飞机滑行排序
混合整数规划
滑行时间
优化
aircraft taxi scheduling
mixed integer linear programming （MILP）
taxi time
optimization
