Facebook pixel tracking

The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us
Research Article | Open Access |

A Hybrid Approach to Automatic Timetabling Using Self-Organizing Maps, Secure Convex Dominating Sets, and Metaheuristics

Author 1: Elmo Ranolo Author 2: Ken Gorro Author 3: Pierre Anthony Gwen Abella Author 4: Lawrence Roble Author 5: Rue Nicole Santillan Author 6: Anthony Ilano Author 7: Benjie Ociones Author 8: Roel Vasquez Author 9: Deofel Balijon Author 10: Daniel Ariaso Sr. Author 11: Rose Ann Campita Author 12: Robert Jay Angco
International Journal of Advanced Computer Science and Applications (IJACSA) · Vol. 16, No. 8 · Published 2025

DOI: https://doi.org/10.14569/IJACSA.2025.0160805

Abstract

Creating conflict-free academic timetables that respect teacher availability, subject eligibility, and limited re-sources remains a persistent challenge in educational institutions. This study introduces a novel hybrid algorithm that combines Self-Organizing Maps (SOM), Secure Convex Dominating Sets (SCDS), and Genetic Algorithms (GA) to address this problem effectively. SOM is employed to cluster subjects based on teaching duration and eligibility, providing structured guidance in initial scheduling. SCDS identifies the most conflict-prone subjects—typically those with limited eligible teachers—and ensures they are prioritized, thereby reducing downstream bottlenecks. GA then iteratively refines the schedule by evaluating room assignments, teacher loads, and constraint satisfaction. Extensive simulation experiments were conducted under varying conditions, including worst-case scenarios with dense scheduling conflicts. The system achieved high success rates, particularly in moderate to complex settings, and demonstrated robustness even in constrained environments. Notably, SOM improved spatial and temporal coherence, while SCDS enhanced conflict resolution and GA enabled adaptive optimization. Runtime and convergence results remained within practical limits, with a time complexity of O(n2+gpn). The proposed hybrid framework balances structural prioritization and evolutionary refinement, offering a scalable and intelligent solution to the timetabling problem. It stands out by gracefully handling worst-case scenarios where traditional heuristics often fail.

Keywords

How to Cite this Article

Ranolo, E., Gorro, K., Abella, P. A. G., Roble, L., Santillan, R. N., Ilano, A., Ociones, B., Vasquez, R., Balijon, D., Sr., D. A., Campita, R. A., & Angco, R. J. (2025). A Hybrid Approach to Automatic Timetabling Using Self-Organizing Maps, Secure Convex Dominating Sets, and Metaheuristics. International Journal of Advanced Computer Science and Applications, 16(8). https://doi.org/10.14569/IJACSA.2025.0160805

Ranolo, Elmo, et al.. "A Hybrid Approach to Automatic Timetabling Using Self-Organizing Maps, Secure Convex Dominating Sets, and Metaheuristics." International Journal of Advanced Computer Science and Applications, vol. 16, no. 8, 2025, https://doi.org/10.14569/IJACSA.2025.0160805.

@article{Ranolo2025,
  title     = {A Hybrid Approach to Automatic Timetabling Using Self-Organizing Maps, Secure Convex Dominating Sets, and Metaheuristics},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {16},
  number    = {8},
  year      = {2025},
  publisher = {The Science and Information Organization},
  author    = {Elmo Ranolo and Ken Gorro and Pierre Anthony Gwen Abella and Lawrence Roble and Rue Nicole Santillan and Anthony Ilano and Benjie Ociones and Roel Vasquez and Deofel Balijon and Daniel Ariaso Sr. and Rose Ann Campita and Robert Jay Angco},
  doi       = {10.14569/IJACSA.2025.0160805},
  url       = {https://doi.org/10.14569/IJACSA.2025.0160805}
}

Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.