<![CDATA[This study aims to develop and evaluate a web-based university course timetabling system that hybridizes a Genetic Algorithm (GA) with DSATUR graph-coloring seeding, and to quantify the separate effects of room-type constraints and DSATUR seeding on hard-constraint satisfaction and convergence. The system was developed using the 4D model (Define, Design, Develop, Disseminate) and implemented in the CodeIgniter framework. Real data from the odd semester of the 2025/2026 academic year of the Visual Communication Design Study Program, Universitas Negeri Padang, were used, comprising 87 class sections, 26 courses, 16 lecturers, 12 theory rooms, and 6 practicum studios. A conflict was operationally defined as a lecturer or a room assigned to more than one class section in the same time slot, and a run was successful when it reached the maximum fitness of 87 with zero conflicts. Three stages were compared over ten independent runs each: a basic GA (Stage 1), a GA with room-type separation (Stage 2), and a GA with room-type separation and a 10% DSATUR-seeded initial population (Stage 3). Differences were tested using Fisher’s exact test and Welch’s t-test, with Cohen’s d as the effect size. Room-type separation increased the success rate from 10% to 100% (p < 0.001) and reduced the mean convergence generation from 405.9 to 174.4 (p < 0.001). DSATUR seeding further reduced the mean convergence generation by 15.5% (from 174.4 to 147.3) and the mean computation time by 9.8% (from 71.16 s to 64.22 s); however, these reductions were not statistically significant with ten runs (p = 0.372 and p = 0.132). The findings show that domain-specific constraint modeling is the decisive factor for feasibility, whereas heuristic seeding provides a moderate efficiency gain. The final system produced conflict-free timetables in every run and reduced a manual process of several days to about one minute of computation.]]>
Copyrights © 2026
