Airport management: taxi planning

Ángel Marín ()

Annals of Operations Research, 2006, vol. 143, issue 1, 202 pages

Abstract: The Taxi Planning studies the aircraft routing and scheduling on the airport ground. This is a dynamic problem, which must be updated almost every time that a new aircraft enters or exits the system. Taxi Planning has been modelled using a linear multicommodity flow network model with side constraints and binary variables. The flow capacity constraints are used to represent the conflicts and competence between aircrafts using a given airport capacity. The “Branch and Bound” and “Fix and Relax” methodologies have been used. The computational tests have been run at the Madrid-Barajas airport, using actual data from the airport traffic. Copyright Springer Science + Business Media, Inc. 2006

Keywords: Aircraft routing and scheduling; Taxi Planning; Airport management; Binary capacitated multicommodity flow network; Branch and Bound; Fix and Relax (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-006-7381-2 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:143:y:2006:i:1:p:191-202:10.1007/s10479-006-7381-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-006-7381-2

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().