A matheuristic for practical flights arrival and departure scheduling

Publication Type:
Conference Proceeding
IEEE International Conference on Industrial Engineering and Engineering Management, 2021, 2020-December, pp. 1162-1166
Issue Date:
Filename Description Size
A_Matheuristic_for_Practical_Flights_Arrival_and_Departure_Scheduling.pdfPublished version3.94 MB
Adobe PDF
Full metadata record
Delays in flights arrival and departure are costly because they adversely impact the passenger experience and result in significant operational costs. Effective management of runways considerably contributes to minimizing such delays. In this paper, we propose an efficient matheuristic algorithm, namely the relax-and-solve (RS), for the problem of scheduling flights arrival and departure on airport's runway with the objective function of minimizing the weighted delays, where delay is measured by the total deviation from the target arrival and departure times. We test the proposed RS on two sets of 27 real-world instances for Milan international airport, and compare the results of our RS and the optimal solution of the same instances. We show that our proposed algorithm obtains almost all the best- known solutions within one minute, even for the largest instances including 170 aircraft. Those characteristics of the proposed RS algorithm are very important for practical settings, particularly, the typical short time window available for planning the aircraft landings and departures at busy airports demands for quick delivery of quality schedules (or updating the current schedule), and fast and effective algorithms are therefore paramount.
Please use this identifier to cite or link to this item: