期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2013
卷号：4
期号：4
页码：354-357
语种：English
出版社：Ayushmaan Technologies
摘要：Genetic Algorithm is population based heuristic method extensively used in scheduling applied for constraint optimization problem. In Genetic Algorithm we generated random solutions rst called as populations and then try to generate feasible solution with the help of operations like selection, crossover and mutation. Scheduling class timetable is common scheduling problem in which a set of events is to be arranged in available timeslots along with limited resources and constraints. Selection of solutions is an important function in genetic algorithm which decides the quality of ospring generated. Selection is a way to make space for good solution to in and bad solution to out from population. In this project, we worked with small instance of timetable problem which required scheduling 100 events in 45 timeslots. We used tournament selection II and tournament selection V to check the quality of ospring generated. We found considerable improvement in solution generated with tournament selection V.
