Integration of aircraft ground movements and runway operations
Julien Guépet,
Olivier Briant,
Jean-Philippe Gayon and
Rodrigo Acuna-Agost
Transportation Research Part E: Logistics and Transportation Review, 2017, vol. 104, issue C, 131-149
Abstract:
The Ground Routing Problem focuses on finding the optimal routing of aircraft from parking stands to runways. The Runway Sequencing Problem consists in ordering the sequence of takes-offs and landings on runways. We study the integration of these two problems with the aim of simultaneously increasing runway efficiency and reducing taxi times. We propose a heuristic sequential approach based on a novel mathematical formulation. We test our methods using real data of a major European airport. Our approach significantly reduces the total completion and taxi times within reasonable computation times, making it viable to be used in daily operations.
Keywords: Ground routing; Runway sequencing; Mixed integer programming (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554516308237
Full text for ScienceDirect subscribers only
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:eee:transe:v:104:y:2017:i:c:p:131-149
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic
DOI: 10.1016/j.tre.2017.05.002
Access Statistics for this article
Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley
More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().