Recovery of disrupted airline operations using k-maximum matching in graphs

Nicolas Nisse, Alexandre Salch and Valentin Weber

European Journal of Operational Research, 2023, vol. 309, issue 3, 1061-1072

Abstract: When an aircraft is approaching an airport, it gets a short time interval called a slot by Air Traffic Control that it can use to land. If the landing of the aircraft is delayed for some reason, it loses its slot and Airline Operation Controllers have to assign it a new one. However, landing slots are a scarce resource of the airports and, in order to avoid that an aircraft waits too long, Airline Operation Controllers have to regularly modify the assignment of slots to the aircraft. Due to the system implemented to exchange slots, controllers can modify the slot-assignment using only two kinds of operations: either assign a slot that was free to aircraft A, or give the slot of another aircraft B to A and assign a free slot to B. The problem can then be modelled as follows.

Keywords: Graph theory; Matching; Augmenting paths; Complexity (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221717311669
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:ejores:v:309:y:2023:i:3:p:1061-1072

DOI: 10.1016/j.ejor.2017.12.033

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().