TY - JOUR
T1 - Solving university course timetabling problem using localized island model genetic algorithm with dual dynamic migration policy
AU - Gozali, Alfian A.
AU - Kurniawan, Bobby
AU - Weng, Wei
AU - Fujimura, Shigeru
N1 - Funding Information:
We thank the Indonesia Endowment Fund for Education (LPDP), a scholarship from the Ministry of Finance, Republic of Indonesia, for supporting this work. This work was conducted at the Graduate School of Information, Production, and Systems, Waseda University.
Funding Information:
We thank the Indonesia Endowment Fund for Education (LPDP), a scholarship from the Ministry of Finance, Republic of Indonesia, for supporting this work. This work was conducted at the Graduate School of Information, Production, and Systems, Waseda University.
Publisher Copyright:
© 2019 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.
PY - 2020/3/1
Y1 - 2020/3/1
N2 - The University Course Timetabling Problem (UCTP) is a scheduling problem of assigning a teaching event in a certain time and room by considering the constraints of university stakeholders such as students, lecturers, and departments. This problem becomes complicated for universities with a large number of students and lecturers. Moreover, several universities are implementing student sectioning, which is a problem of assigning students to classes of a subject while respecting individual student requests, along with additional constraints. Such implementation also implies the complexity of constraints, which is larger accordingly. However, current and generic solvers have failed to meet the scalability and reliability requirements for student sectioning UCTP. In this paper, we introduce the localized island model genetic algorithm with dual dynamic migration policy (DM-LIMGA) to solve student sectioning UCTP. Our research shows that DM-LIMGA can produce a feasible timetable for the student sectioning problem and get better results than previous works and the current UCTP solver. Our proposed solution also consistently yield lower violation number than other algorithms, as evidenced by UCTP benchmark experiment results.
AB - The University Course Timetabling Problem (UCTP) is a scheduling problem of assigning a teaching event in a certain time and room by considering the constraints of university stakeholders such as students, lecturers, and departments. This problem becomes complicated for universities with a large number of students and lecturers. Moreover, several universities are implementing student sectioning, which is a problem of assigning students to classes of a subject while respecting individual student requests, along with additional constraints. Such implementation also implies the complexity of constraints, which is larger accordingly. However, current and generic solvers have failed to meet the scalability and reliability requirements for student sectioning UCTP. In this paper, we introduce the localized island model genetic algorithm with dual dynamic migration policy (DM-LIMGA) to solve student sectioning UCTP. Our research shows that DM-LIMGA can produce a feasible timetable for the student sectioning problem and get better results than previous works and the current UCTP solver. Our proposed solution also consistently yield lower violation number than other algorithms, as evidenced by UCTP benchmark experiment results.
KW - University course timetabling problem
KW - island model genetic algorithm
KW - localization strategy
KW - migration policy
UR - http://www.scopus.com/inward/record.url?scp=85076095832&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85076095832&partnerID=8YFLogxK
U2 - 10.1002/tee.23067
DO - 10.1002/tee.23067
M3 - Article
AN - SCOPUS:85076095832
VL - 15
SP - 389
EP - 400
JO - IEEJ Transactions on Electrical and Electronic Engineering
JF - IEEJ Transactions on Electrical and Electronic Engineering
SN - 1931-4973
IS - 3
ER -