|
| Method | References | Approach/results | Problem type |
|
| Exact algorithms | Mangoubi and Mathaisel [11] | Linear programming relaxation | Real case (Toronto International Airport) |
| Bihr [12] | Primal-dual simplex | Theoretical |
| Yan and Huo [2] | Simplex;
branch and bound | Real case (Chiang Kai-Shek Airport) |
| Bolat [30, 34]; Xu and Bailey [14]; Li [39] | Branch and bound | Real case (King Khaled International Airport, KSA); theoretical |
|
| Heuristic algorithms | Thengvall et al. [43] | Bundle algorithm approach | Theoretical |
| Yan and Tang [10] | Heuristic approach embedded in a framework designed | Real case (Taiwan International Airport) |
| Ding et al. [6, 35] | Greedy algorithm | Theoretical |
| Lim et al. [24] | The Insert Move Algorithm, the Interval Exchange Move Algorithm, and a Greedy Algorithm | Theoretical |
| Diepen et al. [25] | Column generation | Real case (Amsterdam Airport Schiphol) |
| Dorndorf et al. [8] | Heuristic based on the ejection chain algorithm | Theoretical |
| Mangoubi and Mathaisel [11] | Heuristic approach | Real case (Toronto International Airport) |
| Vanderstraeten and Bergeron [28] | ADAP | Theoretical |
| Yan et al. [29] | Greedy heuristics | Real case (Chiang Kai-Shek Airport) |
| Bolat [30] | Heuristic branch and trim | Real case (King Khaled International Airport, KSA) |
| Bolat [34] | Heuristic branch and bound, SPH heuristic | Real case (King Khaled International Airport, KSA) |
| Haghani and Chen [13] | Heuristic approach | Theoretical |
| Genç [42] | Ground time maximization heuristic, and idle time minimization heuristic | Theoretical and real case (Ataturk Airport of Istanbul, Turkey) |
| B.A.C.o.E.B. Team and A.I.C.o.E. Team [17] | A hybrid heuristics algorithm guided by simulated annealing and greedy heuristic | Theoretical |
| Bouras et al. [45] | Heuristic approach | Theoretical |
|
| Metaheuristic algorithms | Ding et al. [6, 35] | Tabu search | Theoretical |
| Ding et al. [7] | Simulated annealing, hybrid of simulated annealing and tabu search | Theoretical |
| Lim et al. [24] | TS algorithm and a memetic algorithm | Theoretical |
| Hu and Di Paolo [36] | New genetic algorithm with uniform crossover | Theoretical |
| Drexl and Nikulin [3] | Pareto simulated annealing | Theoretical |
| Xu and Bailey [14] | Tabu search | Theoretical |
| Bolat [31] | Genetic algorithm | Real case (King Khaled International Airport, KSA) |
| Şeker and Noyan [9] | Tabu search algorithms | Theoretical |
| Zheng et al. [33] | A tabu search algorithm and metaheuristic method | Real case (Beijing International Airport, China) |
| Wei and Liu [16] | A hybrid genetic algorithm | Theoretical |
| Gu and Chung [44] | Genetic algorithms approach | Theoretical |
|
Cheng et al. [23] | Genetic algorithm (GA), tabu search (TS), simulated annealing (SA), and a hybrid approach based on SA and TS | Real case (Incheon International Airport, South Korea) |
| Bouras et al. [45] | Genetic algorithm (GA), tabu search (TS), and simulated annealing (SA) | Theoretical |
|
| OPL | Li [5, 32] | Optimization programming language (CPLEX) | Real case (Continental Airlines, Houston Gorge Bush Intercontinental Airport) |
| Tang et al. [27] | Using CPLEX 10.0 solver concert with C language | Real case (Taiwan International Airport) |
| Prem Kumar and Bierlaire [18] | Optimization
programming language (OPL) | Theoretical |
| Maharjan and Matis [40] | AMPL/CPLEX 11.2 | Real case (Continental Airlines at George W. Bush Intercontinental Airport in Houston (IAH)) |
|
