Swarm Intelligence Framework using Hybrid ACO–PSO  for Lecture Scheduling in Higher Education

Rahmad Hidayat; Ninik Sri Lestari; Sukirno Sukirno; Rosmalina Rosmalina; Herawati YS; Givy Devira Ramady; Asep Suhana; Raden Willa Permatasari; Ganjar Kurniawan Sukandi; Salamatul Afiyah; Rukman Aca; Handoko Subawi

doi:10.29040/ijcis.v6i3.252

Swarm Intelligence Framework using Hybrid ACO–PSO for Lecture Scheduling in Higher Education

Rahmad Hidayat, Ninik Sri Lestari, Sukirno Sukirno, Rosmalina Rosmalina, Herawati YS, Givy Devira Ramady, Asep Suhana, Raden Willa Permatasari, Ganjar Kurniawan Sukandi, Salamatul Afiyah, Rukman Aca, Handoko Subawi

Abstract

Complex combinatorial optimization problems that must meet various hard constraints and soft constraints occur in lecture scheduling. A feasible and high-quality schedule in limited computing time is often difficult to produce using conventional methods. In this study, a hybrid optimization model is proposed that combines Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO), the aim of which is to improve solution quality and convergence speed. In this model, ACO builds solutions based on pheromone intensity and heuristic information, while PSO is used to dynamically adjust ACO parameters through learning from individual and global search experiences. The model is implemented using MATLAB R2023b and tested on real data involving 10 courses, 4 classrooms, and 6 time slots per day. The ACO+PSO approach is significantly able to reduce the penalty value. This approach reflects better fulfillment of constraints and is the result of experiments obtained. Compared to pure ACO, the hybrid method shows more consistent and stable performance in various trials. Visualization of parameter convergence also strengthens the effectiveness of this hybrid approach in finding the optimal parameter configuration. This research contributes to the development of an intelligent lecture scheduling system that is adaptive and aligned with institutional policies.

Full Text:

PDF

References

O.S. Adewale, I.E. Onwuka, I.E. Kingsley, “A Tabu Search-based University Lectures Timetable Scheduling Model,” International Journal of Computer Applications, vol. 181, no. 9, pp. 16-23, 2018. DOI=10.5120/ijca2018917599

M. Yazdani, B. Naderi, E. Zeinali, “Algorithms for University Course Scheduling Problems,” Tehnički vjesnik, vol. 24, no. 2, pp. 241-247, 2017.

S. Yarat, S. Senan, Z. Orman, “A Comparative Study on PSO with Other Metaheuristic Methods,” Mercangöz, B.A. (eds) Applying Particle Swarm Optimization. International Series in Operations Research & Management Science, Springer, Cham, vol. 306, 2021. https://doi.org/10.1007/978-3-030-70281-6_4

A. M. Nassef, M. A. Abdelkareem, H. M. Maghrabie, A. Baroutaji, “Hybrid metaheuristic algorithms: a recent comprehensive review with bibliometric analysis,” International Journal of Electrical and Computer Engineering (IJECE), vol. 14, no. 6, pp. 7022-7035, 2024. DOI: 10.11591/ijece.v14i6.

J. Lu, W. Hu, Y. Wang, L. Li, P. Ke, K. Zhang, “A Hybrid Algorithm Based on Particle Swarm Optimization and Ant Colony Optimization Algorithm,” Qiu, M. (eds) Smart Computing and Communication. Lecture Notes in Computer Science, Springer, Cham, vol 10135, 2017. https://doi.org/10.1007/978-3-319-52015-5_3

N. Bhatia, P. Chauhan, H. Yadav, “Applications of Hybrid Particle Swarm Optimization Algorithm: A Survey,” Lecture Notes in Networks and Systems, Springer, Singapore, vol 166, 2021. https://doi.org/10.1007/978-981-15-9689-6_32

R. Dietze, M. Berger, “A Hybrid Particle Swarm Optimization and Hill Climbing Algorithm for Task Scheduling on Heterogeneous Multicore Clusters,” Lecture Notes in Networks and Systems, Springer, Cham., vol 1346, 2025. https://doi.org/10.1007/978-3-031-87647-9_1

B. Shuang, J. Chen, and Z. Li, “Study on hybrid PS-ACO algorithm,” Appl Intell, vol. 34, pp. 64–73, 2011. https://doi.org/10.1007/s10489-009-0179-6

S. Akter, M.H. Khan, L. Nishat, F. Alam, A.W. Reza, M.S. Arefin, “A Hybrid Approach for Improving Task Scheduling Algorithm in the Cloud,” Intelligent Computing and Optimization, Lecture Notes in Networks and Systems, Springer, Cham, vol 854, 2023. https://doi.org/10.1007/978-3-031-50151-7_18

L. Jie, “Optimizing Resource Utilization and Improving Performance in Cloud Computing Through PSO-Based Scheduling and ACO-Based Load Balancing,” J. Inst. Eng. India Ser. B (2024). https://doi.org/10.1007/s40031-024-01139-3

F. Yunita, Pranowo, and A.J. Santoso, “Hybrid model of particle swarm and ant colony optimization in lecture schedule preparation,” AIP Conference Proceedings, vol. 1977, no. 020039, 2018. https://doi.org/10.1063/1.5042895

S. Kaliappan, V. Paranthaman, M. D. R. Kamal, S. Avv, and M. Muthukannan, "A Novel Approach of Particle Swarm and Ant Colony Optimization for Task Scheduling in Cloud," 2024 14th International Conference on Cloud Computing, Data Science & Engineering (Confluence), Noida, India, pp. 272-278, 2024. DOI: 10.1109/Confluence60223.2024.10463398.

J. Lu, A. Teng, J. Zha, L. Shen and Z. Wang, "Cloud Computing Task Scheduling Strategy Based on Improved Ant Colony Optimization (ACO) Algorithm," 2024 IEEE 6th International Conference on Power, Intelligent Computing and Systems (ICPICS), Shenyang, China, pp. 1368-1373, 2024. DOI: 10.1109/ICPICS62053.2024.10796062.

C. Chandrashekar, P. Krishnadoss, V. K Poornachary, B. Ananthakrishnan, and K. Rangasamy, “HWACOA Scheduler: Hybrid Weighted Ant Colony Optimization Algorithm for Task Scheduling in Cloud Computing,” Applied Sciences, vol. 13, no. 6, 3433, 2023. https://doi.org/10.3390/app13063433

N. Jananeeswari, S. Jayakumar, and M. Nagamani, “Multi-Objective for a Partial Flexible Open Shop Scheduling Problem using Hybrid Based Particle Swarm Algorithm and Ant Colony Optimization,” International Journal of Mathematics Trends and Technology-IJMTT 44, vol. 44, no. 2, 2017. DOI :10.14445/22315373/IJMTT-V44P520

T. R. Mahesh, D. Santhakumar, A. Balajee, H. S. Shreenidhi, V. V. Kumar, and J. R. Annand, "Hybrid Ant Lion Mutated Ant Colony Optimizer Technique with Particle Swarm Optimization for Leukemia Prediction Using Microarray Gene Data," IEEE Access, vol. 12, pp. 10910-10919, 2024. DOI: 10.1109/ACCESS.2024.3351871.

E. Koyuncu, R. Erol, “PSO-based approach for scheduling NPD projects including overlapping process,” Computers & Industrial Engineering, vol. 85, pp. 316-327, 2015.

G.S. Rao, C.V.P. Krishna, K.R. Rao, “Multi-Objective Particle Swarm Optimization for Software Cost Estimation,” Advances in Intelligent Systems and Computing, Springer, Cham, vol 248, 2014. https://doi.org/10.1007/978-3-319-03107-1_15

M.N. A. Wahab, S.N. Meziani, and A. Atyabi, “A comprehensive review of swarm optimization algorithms,” PLoS One, vol. 10, no. 5: e0122827, 2015. DOI: 10.1371/journal.pone.0122827.

C.C. Bolton, V. Parada, “Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem,” PLoS One, vol.10, no. 9: e0137724, 2015. DOI: 10.1371/journal.pone.0137724.

Y. Ge, B. Xu, “Dynamic Staffing and Rescheduling in Software Project Management: A Hybrid Approach,” PLoS One, vol. 11, no. 6: e0157104, 2016. DOI: 10.1371/journal.pone.0157104.

DOI: https://doi.org/10.29040/ijcis.v6i3.252