Memetic algorithms for timetabling

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 09 Jul 2004Publisher:IEEEJournal:The 2003 Congress on Evolutionary Computation, 2003. CEC '03., volume 3, pages 1,796-1,802

Authors: Alpay Alkan; Ender Özcan;

doi: 10.1109/cec.2003.1299890

Memetic algorithms for timetabling

- Summary
- Metrics

Abstract

Course timetabling problems are real world constraint optimization problems that are often coped with 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.

Related Organizations

Yeditepe University
Turkey

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	32
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%