D. Garcia Heredia, B. Rybicki
This talk presents the matheuristic algorithm developed by the optimization group of Ryanair Labs to create the airline's flight schedule.
In the problem, the goal is to create a schedule that operates as many flights as possible. The decisions available are what flights should be operated, by which aircraft, and when. This must be done respecting a large list of constraints such as: operational limits of airports, maximum crew working time, or minimum departure time separation between similar routes.
In addition to the difficulties of any scheduling problem, Ryanair, as having hundreds of aircraft operating in hundreds of airports, makes the dimensions of the resulting problem unsolvable by any existing Integer or Constraint Programming solver. Hence the heuristic approach.
Computational results for the Italian market show how our algorithm can largely outperform the current procedure employed at Ryanair in just a few hours.
Palabras clave: Matheuristics, Integer Programming, Flight Scheduling, RyanairProgramado
Sesión Invitada Math-In. Industrial Applications IV
9 de junio de 2022 17:10