Memetic Algorithms for Timetabling (2003)
| Venue: | Proc. of IEEE Congress on Evolutionary Computation |
| Citations: | 13 - 10 self |
BibTeX
@INPROCEEDINGS{Alkan03memeticalgorithms,
author = {Alpay Alkan},
title = {Memetic Algorithms for Timetabling},
booktitle = {Proc. of IEEE Congress on Evolutionary Computation},
year = {2003},
pages = {1796--1802}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract- Course timetabling problems are real world constraint optimization problems that are often coped with in educational institutions, such as universities or high schools. In this paper, we present a variety of new operators that can be also applied in evolutionary algorithms for other timetabling problems, such as, exam timetabling. Operators include violation directed mutations, crossovers, and a successful violation directed hierarchical hill climbing method. Tests are performed on a small portion of a real data and results are promising. 1
