|
| Reference | Work done | Advantages | Disadvantages |
|
| [14] | Build a clever combination of tabu search, simulated annealing, dynamic, and large-neighborhood search | They have larger instances to compare | They do not have any web page for importing data |
| [3] | GBACP uses a hybrid local search-based integer programing paradigm and heuristic solution technique | The chosen heuristic finds high-quality answers within 9%–60% of the lower limit | The current approach does not compensate for the workload distribution of professors who teach over one course |
| [15] | To find the optimal GQAP solution, they gave three unique linearization algorithms as well as a branch and bound approach. They look into a modification of the quadratic assignment problem (QAP) that permits many pieces of equipment to be allocated to a single place as long as the site’s resources allow | Three regularization approaches and a branch and bound algorithm were utilized to resolve the GQAP efficiently | Not mentioned |
| [16] | Describe a novel algorithm for the generalized quadratic assignment problem (GQAP) | Approach is based on the dual ascent technique of the reformulation linearization technique (RLT) | They made no mention of the development of heuristic (most likely meta-heuristic) strategies for getting good results |
| [17] | The strategies, one utilizing the volume algorithm separately and the other integrating the volume algorithm with the transformative lower bounding process, generate significantly higher lower bounds for relaxed GQAP | They also use transformational lower bounding approaches to increase the new procedure’s performance | Not mentioned |
| [18] | Built three separate tabu search methods that distribute available resources to storage locations throughout several time periods while reducing the total of preparation and two-way transit expenses | Less computing time | The parameters for heuristics are more |
| [19] | 3D GQAP model for multistory assignment challenges | A thorough branch-and-bound strategy based on an RLT1 dual ascent procedure has been provided in addition to the approach’s complete mathematics and evolutionary history from quadratic assignment difficulties (QAP) | Not mentioned |
| [13] | They hope to solve BACP by taking a genetic algorithm with CP approaches while also giving a generic foundation for developing such hybrid solution methods and emphasizing its features and characteristics | The proposed framework enables the creation and management of new and refined problem-solving techniques and extensions | Not mentioned |
| [3] | Provide a genetic local search method to tackle the problem of curriculum balance by utilizing two objectives. They created a basic genetic local search algorithm | The technique employs a mutation-like operator (MSA) to perform simulated annealing. Consequently, depending on the temperature measurements, the algorithm does both exploitation and exploration | The primary drawback is that it takes longer to find the best answer |
| [20] | Customized BACP in which the educational workloads and variety of courses can be the same or vary for each period and certain courses can be taken at specified times | Utilization of tabu search with short-term memory is suggested as a solution because no solution can be found for all situations of this changed issue using an exact technique | Not mentioned |
| [12] | Combining the models in order to capitalize on the complementary characteristics of each model | Improves domain trimming and even reduces run-time in several cases | Not mentioned |
| [21] | Proposed the best–worst ant system (BWAS) to solve the BACP | A restart mechanism prevents the algorithm from being stuck and executing superfluous iterations | The proposed strategy has not been tested for the complicated versions of BACP datasets |
| [4] | Suggest a crucial-based curriculum balancing (CBCB) model that is enacted as a multiobjective optimization issue with linear objective functions that also has a benefit over the suggested relevance-based curriculum balancing model | Design a syllabus that is more applicable to real circumstances, not only just by shortening the gap between essential courses but also by shifting those to the next accessible term while adhering to the BACP restrictions | One drawback is that the authors did not include the course difficulty criteria. The primary drawback is that the academic load limit is stated in an inefficient manner |
| [22] | Optimization algorithm based on the firefly attraction (FA) meta-heuristic to solve the BACP | Relatively rapid convergence and reaches the known optimum in the majority of the tests performed | They do not apply the local search mechanism, which leads to results stuck in the local optima |
|
