S. Vivó Sánchez, F. Perea Rojas-Marcos
Airline scheduling is a complex optimization problem traditionally tackled with Mixed Integer Linear Programming (MILP) using solvers like Gurobi or decomposition methods such as Column Generation. While effective, these methods struggle with large-scale airline operations due to computational complexity and solver limitations.
In this talk, we explore non-traditional approaches, focusing on Hexaly, a next-generation optimization solver.
We compare its performance against MILP and decomposition-based methods in terms of solution quality, runtime, and scalability. Key constraints, such as slot capacity, day spread and flight time limitations are analyzed to highlight the advantages of these innovative techniques.
Keywords: Scheduling, Airline, Hexaly
Scheduled
Last-Mile Transportation and Logistics
June 12, 2025 3:30 PM
Sala de prensa (MR 13)