A simple and efficient metaheuristic for the dynamic flight scheduling problem

Pol Arias, Daniel Guimarans, Àngel A. Juan

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch


One of the biggest problems in the airline industry is facing the uncertainty created by passengers demand. In this work, we introduce a metaheuristic that uses updated demand forecasts to optimise a given flight schedule. The algorithm uses two main techniques to solve the problem: (i) re-timing, aimed at changing the scheduled time of a flight by delaying or advancing it to allow new connections; and, (ii) re-fleeting is focused on swapping aircraft between flights to increase aicraft’s occupancy and better adjust it to demand. The algorithm’s objective is to maximise airlines revenue by increasing the occupancy of each flight. This metaheuristic has been tested in different scenarios of up to 600 flights with promising results in low CPU times.
Original languageEnglish
Title of host publicationMetaheuristics
Subtitle of host publicationProceeding of the MIC and MAEB 2017 Conferences
EditorsAbraham Duarte, Ana Viana, Angel Juan, Belén Mélian, Helena Ramalhinho
Place of PublicationBarcelona Spain
PublisherUniversitat Pompeu Fabra
Number of pages3
ISBN (Electronic)9788469742751
Publication statusPublished - 2017
Externally publishedYes
EventMetaheuristics International Conference 2017 - Barcelona, Spain
Duration: 4 Jul 20177 Jul 2017
Conference number: 12th


ConferenceMetaheuristics International Conference 2017
Abbreviated titleMIC 2017
Internet address

Cite this