Review Article
An Assignment Problem and Its Application in Education Domain: A Review and Potential Path
Table 6
Summary of studies related to CTP.
| Approach | Reference (s) |
| Exact method | Integer linear programming | Oladokun and Badmus [55]; Thongsanit [56] | Decomposition approach | Vermuyten et al. [60] |
| Heuristic technique | Integer linear programming based heuristics | Méndez-Díaz et al. [58] |
| Metaheuristic technique | | | Local search based | Simulated annealing | Ceschia et al. [61] | Hyper-heuristics iterated local search | Soria-Alcaraz et al. [62] | Two stage metaheuristics | Lewis and Thompson [63] | Local search-based algorithm with adaptive mechanism | Nagata [64] | Variable neighborhood descent | Borchani et al. [57] | Tabu search with sampling and perturbation + SA with reheating | Goh et al. [65] | Nonlinear great deluge hyper-heuristics with reinforcement learning | Obit et al. [66] | Population search based | Ant colony optimisation | Nothegger et al. [67] | Genetic algorithm | Song et al. [68] |
| Hybrid | Integer programming + greedy heuristics + modified simulated annealing | Gunawan et al. [54] | Genetic algorithm + local search | Badoni et al. [69] | Artificial bee colony algorithm + hill climbing optimizer | Bolaji et al. [70] | Integer programming + greedy heuristics | Ghiani et al. [71] | Hybrid multi-objective genetic algorithm + hill climbing + simulated annealing | Akkan and Gülcü [72] | Harmony search with great deluge | Wahid and Hussin [59] |
|
|