Search for items in this repository.
Airport Taxi Planning: Lagrangian Decomposition
Marín Gracia, Angel
Airport Taxi Planning: Lagrangian Decomposition.
"Journal of Advanced Transportation", v. 47
||Airport Taxi Planning: Lagrangian Decomposition
|Título de Revista/Publicación:
||Journal of Advanced Transportation
||taxi planning; airport management; binary multi‐commodity flow network; Lagrangian decomposition
||E.T.S.I. Aeronáuticos (UPM)
||Matemática Aplicada y Estadística [hasta 2014]
|Creative Commons Licenses:
||Recognition - No derivative works - Non commercial
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
Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
Check whether the spanish journal in which you have published an article allows you to also publish it under open access.