Wibowo, Antoni and Teoh, Chong Keat and Ngadiman, Mohd. Salihin (2014) An adapted cuckoo optimization algorithm and genetic algorithm approach to the university course timetabling problem. International Journal of Computational Intelligence and Applications, 13 (1). ISSN 1469-0268
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1142/S1469026814500023
Abstract
The university course timetabling problem is an NP-hard and NP-complete problem concerned with assigning a specific set of events and resources to timeslots under a highly-constrained search space. This paper presents a novel metaheuristic algorithm entitled adapted cuckoo optimization algorithm which is derived from the cuckoo optimization algorithm and cuckoo search algorithm. This algorithm includes features such as local random walk on discrete data which mimics the behavior of Lévy flights and an Elitism-based mechanism which echoes back the best candidate solutions and prevents the algorithm from plunging into a curse of dimensionality. The algorithm was tested on a problem instance gathered from a University in Malaysia and the results indicate that the proposed algorithm exhibits very promising results in terms of solution quality and computational speed when compared to genetic algorithms
Item Type: | Article |
---|---|
Uncontrolled Keywords: | cuckoo optimization algorithm, cuckoo search, genetic algorithms, university course timetabling problem |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Divisions: | Computing |
ID Code: | 51760 |
Deposited By: | Siti Nor Hashidah Zakaria |
Deposited On: | 01 Feb 2016 03:52 |
Last Modified: | 14 Oct 2018 08:37 |
Repository Staff Only: item control page