From a computational standpoint, Zografos et al. (2012) tested their model at a small airport, Iraklion (Greece), which handles less than 50,000 aircraft movements per year. In this case, it could be solved (to exact optimality) using commercial solvers. For midsize airports (e.g., Porto airport, which handles nearly 100,000 aircraft movements per year), mathematical programming solvers will probably also work reasonably well, but formulation and tractability issues will certainly be a concern (Williams 2013). For large airports (e.g., Lisbon and Sao Paulo, with 175,000 and 300,000 movements per year, respectively), the model is expected to be computationally tractable only through the use of specialized methods like hybrid metaheuristics (Talbi 2013; Junqueira et al. 2013; Oliveira et al. 2014). These algorithms combine classical metaheuristics with mathematical programming, constraint programming or dynamic programming, and although they do not guarantee optimal solutions, they will provide near-optimal solutions in efficient computational times if properly built and calibrated.