DocumentCode
2061566
Title
Big Bang-Big Crunch optimization algorithm to solve the course timetabling problem
Author
Jaradat, Ghaith M. ; Ayob, Masri
Author_Institution
Data Min. & Optimization Res. Group, Nat. Univ. of Malaysia, Bangi, Malaysia
fYear
2010
fDate
Nov. 29 2010-Dec. 1 2010
Firstpage
1448
Lastpage
1452
Abstract
In this study, we present the Big Bang-Big Crunch (BB-BC) method to solve the post-enrolment course timetabling problem. This method is derived from one of the evolution of the universe theories in physics and astronomy. The BB-BC theory involves two phases (Big Bang and Big Crunch). The Big Bang phase feeds the Big Crunch phase with many inputs and the Big Crunch phase is the shrinking destiny of the universe into singularity. Generally, the BB-BC algorithm generates a population of random initial solutions in the Big Bang phase and shrinks those solutions to a single good quality solution represented by a centre of mass. Experimental results show that the BB-BC can produce good quality solutions and comparable with some of the methods applied in the literature (with regards to Socha´s benchmark instances).
Keywords
computational complexity; educational courses; optimisation; NP-hard problem; big bang-big crunch optimization algorithm; post-enrolment course timetabling problem; big bang-big crunch; post-enrolment course timetabling problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems Design and Applications (ISDA), 2010 10th International Conference on
Conference_Location
Cairo
Print_ISBN
978-1-4244-8134-7
Type
conf
DOI
10.1109/ISDA.2010.5687114
Filename
5687114
Link To Document