Academic Journals Database
Disseminating quality controlled scientific knowledge

Optimization: A Comparative Study of Genetic and Tabu Search Algorithms

ADD TO MY LIST
 
Author(s): "Bajeh, A. O" | "Abolarinwa, K. O"

Journal: International Journal of Computer Applications
ISSN 0975-8887

Volume: 31;
Issue: 5;
Start page: 43;
Date: 2011;
Original page

Keywords: Chromosome | Examination timetabling | Genetic Algorithm | Tabu Search | Generation

ABSTRACT
Examination timetabling problem like all scheduling problems are NPhard problems in which the complexity and time needed to solve the problem increase with the problem size. This paper aims to compare Genetic Algorithm and Tabu Search approaches to solve this kind of problem. Both algorithms were tested with regard to the quality of generated timetables and the speed with which the timetables are generated using collected test data. The test shows that though both algorithms are capable of handling the examination timetabling problem, the Tabu Search approach can produce better timetables than Genetic Algorithm, even at a greater speed.
Save time & money - Smart Internet Solutions      Why do you need a reservation system?