Int. J. of Granular Computing, Rough Sets and Intelligent Systems   »   2011 Vol.2, No.1

 

 

Title: The optimum genetic operators' selection method in genetic algorithm for the space allocation problem

 

Author: Sivarenuka Devi Chandrakaisan, Ahamad Tajudin Khader, Mohammed Azmi Al-Betar

 

Addresses:
School of Computer Sciences, Universiti Sains Malaysia, 11800, Pulau Pinang, Malaysia.
School of Computer Sciences, Universiti Sains Malaysia, 11800, Pulau Pinang, Malaysia.
Department of Computer Science in Al-zaytoonah University, Amman, Jordan; School of Computer Science, University Sains Malaysia (USM), 11800, Minden, Penang, Malaysia

 

Abstract: The space allocation problem particularly in academic institutions is well known as a complex, difficult and time consuming task. This paper investigates the optimum genetic operators' selection method in genetic algorithm in handling combinatorial optimisation problems. The discussed space allocation problem focuses on the distribution of timetable among available lecture halls and rooms in the university. We investigate the optimum selection method to select parents during the reproduction and crossover genetic operations. The investigated selection methods are random, deterministic and roulette wheel selection.

 

Keywords: space allocation; genetic algorithms; GAs; combinatorial optimisation; optimum genetic operators; selection method; random selection; deterministic selection; roulette wheel selection; university timetabling; higher education.

 

DOI: 10.1504/IJGCRSIS.2011.041461

 

Int. J. of Granular Computing, Rough Sets and Intelligent Systems, 2011 Vol.2, No.1, pp.71 - 86

 

Available online: 23 Jul 2011

 

 

Editors Full text accessAccess for SubscribersPurchase this articleComment on this article