Texto completo
Vista Previa |
PDF (Portable Document Format)
- Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (903kB) | Vista Previa |
ORCID: https://orcid.org/0000-0001-6912-0893
(2011).
Airport Taxi Planning: Lagrangian Decomposition.
"Journal of Advanced Transportation", v. 47
(n. 4);
pp. 461-474.
ISSN 0197-6729.
https://doi.org/10.1002/atr.175.
| Título: | Airport Taxi Planning: Lagrangian Decomposition |
|---|---|
| Autor/es: |
|
| Tipo de Documento: | Artículo |
| Título de Revista/Publicación: | Journal of Advanced Transportation |
| Fecha: | Julio 2011 |
| ISSN: | 0197-6729 |
| Volumen: | 47 |
| Número: | 4 |
| Materias: | |
| ODS: | |
| Palabras Clave Informales: | taxi planning; airport management; binary multi‐commodity flow network; Lagrangian decomposition |
| Escuela: | E.T.S.I. Aeronáuticos (UPM) [antigua denominación] |
| Departamento: | Matemática Aplicada y Estadística [hasta 2014] |
| Licencias Creative Commons: | Reconocimiento - Sin obra derivada - No comercial |
Vista Previa |
PDF (Portable Document Format)
- Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (903kB) | Vista Previa |
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
| ID de Registro: | 15277 |
|---|---|
| Identificador DC: | https://oa.upm.es/15277/ |
| Identificador OAI: | oai:oa.upm.es:15277 |
| URL Portal Científico: | https://portalcientifico.upm.es/es/ipublic/item/5488559 |
| Identificador DOI: | 10.1002/atr.175 |
| URL Oficial: | http://onlinelibrary.wiley.com/doi/10.1002/atr.175... |
| Depositado por: | Memoria Investigacion |
| Depositado el: | 02 Abr 2014 15:44 |
| Ultima Modificación: | 12 Nov 2025 00:00 |
Publicar en el Archivo Digital desde el Portal Científico