IJMECS Vol. 17, No. 3, 8 Jun. 2025
Cover page and Table of Contents: PDF (size: 738KB)
PDF (738KB), PP.1-14
Views: 0 Downloads: 0
Balanced Academic Curriculum Problem, Curriculum Optimization, Student Academic Load, Teaching Learning Based Optimization
The Balanced Academic Curriculum Problem (BACP) is a complex optimization problem in educational institutions, involving the allocation of courses across academic terms while satisfying various constraints. This study aims to optimize BACP using the Teaching-Learning Based Optimization (TLBO) algorithm, addressing the limitations of existing approaches and providing an efficient framework for curriculum balancing. The novelty lies in applying TLBO to BACP, offering a parameter-free, nature-inspired metaheuristic that balances exploration and exploitation effectively. The proposed method models BACP as a mathematical optimization problem and implements TLBO to minimize total load balance delay across academic terms. Computational experiments were conducted on 12 benchmark BACP instances, comparing TLBO against eight other metaheuristic algorithms. Results demonstrate TLBO's superior performance, achieving the best solutions in 75-83% of test problems across various indicators. Statistical analysis using the Wilcoxon rank-sum test confirms the significance of TLBO's improvements. The study concludes that TLBO is a robust and efficient tool for optimizing BACP, outperforming existing methods in solution quality and convergence speed. Future research could focus on enhancing TLBO through hybridization with other algorithms and applying it to real-world BACP scenarios in educational institutions.
Mohd Fadzil Faisae Ab Rashid, Wasif Ullah, "Optimization of Balanced Academic Curriculum Problem in Educational Institutions Using Teaching Learning Based Optimization Algorithm", International Journal of Modern Education and Computer Science(IJMECS), Vol.17, No.3, pp. 1-14, 2025. DOI:10.5815/ijmecs.2025.03.01
[1]J. M. Rubio, C. Vidal-Silva, L. Carter, and M. Tupac-Yupanqui, “Balanced Academic Curriculum: Looking For An Optimal Solution With Metaheuristics And Functional Programming,” Turkish Journal of Computer and Mathematics Education, vol. 12, no. 6, pp. 1181–1188, 2021.
[2]A. Katal, V. K. Singh, T. Choudhury, F. Imran, and M. S. Hossain, “Balancing Academic Curriculum Problem Solution: A Discrete Firefly-Based Approach,” Educ Res Int, vol. 2023, 2023, doi: 10.1155/2023/4300472.
[3]L. V Rosas-Tellez, V. Zanella-Palacios, and J. L. Martínez-Flores, “Solution of a Modified Balanced Academic Curriculum Problem Using Evolutionary Strategies,” in Computational Intelligence, K. Madani, A. Dourado, A. Rosa, and J. Filipe, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 49–58.
[4]L. Di Gaspero and A. Schaerf, “Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem,” in Hybrid Metaheuristics in Lecture Notes in Computer Science, M. J. Blesa, C. Blum, C. Cotta, A. J. Fernández, J. E. Gallardo, A. Roli, and M. Sampels, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2008, pp. 146–157.
[5]N. Huntington-Klein and A. Gill, “Semester Course Load and Student Performance,” Res High Educ, vol. 62, no. 5, pp. 623–650, 2021, doi: 10.1007/s11162-020-09614-8.
[6]R. F. Szafran, “The Effect of Academic Load on Success for New College Students: Is Lighter Better?,” Res High Educ, vol. 42, no. 1, pp. 27–50, 2001, doi: 10.1023/A:1018712527023.
[7]T. Lambert, C. Castro, E. Monfroy, and F. Saubion, “Solving the Balanced Academic Curriculum Problem with an Hybridization of Genetic Algorithm and Constraint Propagation,” in Artificial Intelligence and Soft Computing – ICAISC 2006, L. Rutkowski, R. Tadeusiewicz, L. A. Zadeh, and J. M. Żurada, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 410–419.
[8]T. Lambert, C. Castro, E. Monfroy, M. C. Riff, and F. Saubion, “Hybridization of Genetic Algorithms and Constraint Propagation for the BACP,” in Logic Programming, M. Gabbrielli and G. Gupta, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 421–423.
[9]C. Castro, B. Crawford, and E. Monfroy, “A Genetic Local Search Algorithm for the Multiple Optimisation of the Balanced Academic Curriculum Problem,” in Cutting-Edge Research Topics on Multiple Criteria Decision Making, Y. Shi, S. Wang, Y. Peng, J. Li, and Y. Zeng, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 824–832.
[10]K. Sylejmani, A. Halili, and A. Rexhepi, “Balancing academic curricula by using a mutation-only genetic algorithm,” in 2017 40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), 2017, pp. 1189–1194. doi: 10.23919/MIPRO.2017.7973604.
[11]M. Chakradhar, M. S. Charan, R. U. Sai, M. Kunal, Y. V. S. Murthy, and G. K. Shashidhar, “Academic Curriculum Load Balancing using GA,” in 2019 10th International Conference on Computing, Communication and Networking Technologies (ICCCNT), 2019, pp. 1–5. doi: 10.1109/ICCCNT45670.2019.8944897.
[12]M. Villalobos-Cid, M. Orellana, O. C. Vásquez, E. Pinto-Sothers, and M. Inostroza-Ponta, “Dealing with the Balanced Academic Curriculum Problem considering the Chilean Academic Credit Transfer System,” in 2019 38th International Conference of the Chilean Computer Science Society (SCCC), 2019, pp. 1–7. doi: 10.1109/SCCC49216.2019.8966411.
[13]L. V Rosas-Téllez, J. L. Martínez-Flores, and V. Zanella-Palacios, “Optimal Solution to the Problem of Balanced Academic Curriculum Problem Using Tabu Search,” in Proceedings of the International Conference on Genetic and Evolutionary Methods (GEM), The Steering Committee of The World Congress in Computer Science, 2012.
[14]L. V Rosas-Téllez, J. L. Martinez-Flores, and V. Zanella-Palacios, “Solution to the Balanced Academic Curriculum Problem Using Tabu Search,” Comput Technol Appl, vol. 3, no. 9, pp. 630–635, 2012.
[15]M. Chiarandini, L. Di Gaspero, S. Gualandi, and A. Schaerf, “The Balanced Academic Curriculum Problem Revisited,” Journal of Heuristics, vol. 18, no. 1, pp. 119–148, 2012, doi: 10.1007/s10732-011-9158-2.
[16]J. M. Rubio, C. L. Vidal-Silva, R. Soto, E. Madariaga, F. Johnson, and L. Carter, “Applying FireFly Algorithm to Solve the Problem of Balancing Curricula,” International Journal of Advanced Computer Science and Applications, vol. 10, no. 1, pp. 68–75, 2019, [Online]. Available: www.ijacsa.thesai.org
[17]B. Hnich, Z. Kiziltan, and T. Walsh, “Modelling a Balanced Academic Curriculum Problem,” in Fourth International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems , Le Croisic, France , Mar. 2002.
[18]J.-N. Monette, P. Schaus, S. Zampelli, Y. Deville, and P. Dupont, “A CP Approach to the Balanced Academic Curriculum Problem,” in The Seventh International Workshop on Symmetry and Constraint Satisfaction Problems, USA, Sep. 2007.
[19]L. V Rosas-Tellez, J. L. Martínez-Flores, and V. Zanella-Palacios, “Evolutionary Strategies for the Academic Curriculum Balanced Problem,” in International Conference on Evolutionary Computation Theory and Applications (FEC-2011), SciTePress, 2011, pp. 534–538.
[20]J. M. Rubio et al., “Solving the Balanced Academic Curriculum Problem Using the ACO Metaheuristic,” Math Probl Eng, vol. 2013, p. 793671, 2013, doi: 10.1155/2013/793671.
[21]S. Ceschia, L. Di Gaspero, and A. Schaerf, “The generalized balanced academic curriculum problem with heterogeneous classes,” Ann Oper Res, vol. 218, no. 1, pp. 147–163, 2014, doi: 10.1007/s10479-013-1358-8.
[22]Y. Z. Ünal and Ö. Uysal, “A new mixed integer programming model for curriculum balancing: Application to a Turkish university,” Eur J Oper Res, vol. 238, no. 1, pp. 339–347, 2014, doi: https://doi.org/10.1016/j.ejor.2014.03.015.
[23]A. Slim, G. L. Heileman, E. Lopez, H. Al Yusuf, and C. T. Abdallah, “Crucial based curriculum balancing: A new model for curriculum balancing,” in 2015 10th International Conference on Computer Science & Education (ICCSE), 2015, pp. 243–248.
[24]R. V. Rao, V. J. Savsani, and D. P. Vakharia, “Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems,” CAD Computer Aided Design, vol. 43, no. 3, pp. 303–315, Mar. 2011, doi: 10.1016/j.cad.2010.12.015.
[25]B. Hnich, Z. Kiziltan, and T. Walsh, “Problem 030: Balanced Academic Curriculum Problem (BACP),” CSPLib: A problem library for constraints. [Online]. Available: http://www.csplib.org/Problems/prob030
[26]Marco Dorigo, Vittorio Maniezzo, and Albert0 Colorni, “Ant System: Optimization by a Colony of Cooperating Agents,” vol. 26, no. 1, pp. 29–41, 1996, doi: 10.1109/3477.484436.
[27]H. Jia, H. Rao, C. Wen, and S. Mirjalili, “Crayfish optimization algorithm,” Artif Intell Rev, vol. 56, pp. 1919–1979, Nov. 2023, doi: 10.1007/s10462-023-10567-4.
[28]N. F. Johari, A. M. Zain, N. H. Mustaffa, and A. Udin, “Firefly algorithm for optimization problem,” in Applied Mechanics and Materials, 2013, pp. 512–517. doi: 10.4028/www.scientific.net/AMM.421.512.
[29]R. K. Hamad and T. A. Rashid, “GOOSE Algorithm: A Powerful Optimization Tool for Real-World Engineering Challenges and Beyond.”
[30]S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey Wolf Optimizer,” Advances in Engineering Software, vol. 69, pp. 46–61, 2014, doi: 10.1016/j.advengsoft.2013.12.007.
[31]F. Marini and B. Walczak, “Particle swarm optimization (PSO). A tutorial,” Chemometrics and Intelligent Laboratory Systems, vol. 149, pp. 153–165, Dec. 2015, doi: 10.1016/j.chemolab.2015.08.020.