Constraint-Based School Timetabling Using Hybrid Genetic Algorithms

Authors:
Tuncay Yigit
Affiliations:
Suleyman Demirel University, Engineering and Architecture Faculty, Computer Engineering, 32260, Cunur, Isparta, Turkey
Venue:
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
Year:
2007

Citing 7
Cited 2

Constructing school timetables using simulated annealing: sequential and parallel algorithms

Management Science
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms and Highly Constrained Problems: The Time-Table Case

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
A Hybrid Genetic Algorithm for School Timetabling

AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
An Evolutionary Algorithm for Solving the School Time-Tabling Problem

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Case-based heuristic selection for timetabling problems

Journal of Scheduling

Planning of the GSM network broadcast control channel with data fusion

Expert Systems with Applications: An International Journal
The effect of construction heuristics on the performance of a genetic algorithm for the school timetabling problem

Proceedings of the South African Institute of Computer Scientists and Information Technologists Conference on Knowledge, Innovation and Leadership in a Diverse, Multidisciplinary Environment

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a hybrid genetic algorithm (HGA) has been developed to solve the constraint-based school timetabling problem (CB-STTP). HGA has a new operator called repair operator, in addition to standard crossover and mutation operators. A timetabling tool has been developed for HGA to solve CB-STTP. The timetabling tool has been tested extensively using real-word data obtained the Technical and Vocational High Schools in Turkey. Experimental results have presented that performance of HGA is better than performance of standard GA.