Review Article

An Assignment Problem and Its Application in Education Domain: A Review and Potential Path

Table 6

Summary of studies related to CTP.

ApproachReference (s)

Exact methodInteger linear programmingOladokun and Badmus [55]; Thongsanit [56]
Decomposition approachVermuyten et al. [60]

Heuristic techniqueInteger linear programming based heuristicsMéndez-Díaz et al. [58]

Metaheuristic technique
 Local search basedSimulated annealingCeschia et al. [61]
Hyper-heuristics iterated local searchSoria-Alcaraz et al. [62]
Two stage metaheuristicsLewis and Thompson [63]
Local search-based algorithm with adaptive mechanismNagata [64]
Variable neighborhood descentBorchani et al. [57]
Tabu search with sampling and perturbation + SA with reheatingGoh et al. [65]
Nonlinear great deluge hyper-heuristics with reinforcement learningObit et al. [66]
 Population search basedAnt colony optimisationNothegger et al. [67]
Genetic algorithmSong et al. [68]

HybridInteger programming + greedy heuristics + modified simulated annealingGunawan et al. [54]
Genetic algorithm + local searchBadoni et al. [69]
Artificial bee colony algorithm + hill climbing optimizerBolaji et al. [70]
Integer programming + greedy heuristicsGhiani et al. [71]
Hybrid multi-objective genetic algorithm + hill climbing + simulated annealingAkkan and Gülcü [72]
Harmony search with great delugeWahid and Hussin [59]