The optimum genetic operators' selection method in genetic algorithm for the space allocation problem
by Sivarenuka Devi Chandrakaisan, Ahamad Tajudin Khader, Mohammed Azmi Al-Betar
International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS), Vol. 2, No. 1, 2011

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.

Online publication date: Sat, 28-Feb-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com