首页 | 本学科首页   官方微博 | 高级检索  
     


Airport taxi planning: Lagrangian decomposition
Authors:Ángel G. Marín
Affiliation:Departamento Matemática Aplicada y Estadística, Universidad Politécnica de Madrid, E. T. S. Ingenieros Aeronáuticos, , Madrid, 28040 Spain
Abstract:The airport taxi planning (TP) module is a decision tool intended to guide airport surface management operations. TP is defined by a flow network optimization model that represents flight ground movements and improves aircraft taxiing routes and schedules during periods of aircraft congestion. TP is not intended to operate as a stand‐alone tool for airport operations management: on the contrary, it must be used in conjunction with existing departing and arriving traffic tools and overseen by the taxi planner of the airport, also known as the aircraft ground controller. TP must be flexible in order to accommodate changing inputs while maintaining consistent routes and schedules already delivered from past executions. Within this dynamic environment, the execution time of TP may not exceed a few minutes. Classic methods for solving binary multi‐commodity flow networks with side constraints are not efficient enough; therefore, a Lagrangian decomposition methodology has been adapted to solve it. We demonstrate TP Lagrangian decomposition using actual data from the Madrid‐Barajas Airport. Copyright © 2011 John Wiley & Sons, Ltd.
Keywords:taxi planning  airport management  binary multi‐commodity flow network  Lagrangian decomposition
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号