A Memetic Algorithm for Solving a Timetabling Problem:An Incremental Strategy. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 394-401, 2007.

Paper

Timetabling problems are well known complicated constraint satisfaction problems. A new realworld course timetabling problem is described in this study. The difficulty in approximating to an optimal solution in a reasonable time increases for the large problem instances regardless of the algorithm used. An incremental strategy that aims to relieve this difficulty to some extent combined with a memetic algorithm (MA) is investigated for solving the new timetabling problem. The incremental MA is a multistage approach that enlarges the size of the candidate solutions by adding a selected subset of unscheduled course meetings at a stage. A solution is then sought for all the course meetings at hand. The initial results show that the incremental MA is promising.

You can download the pdf of this publication from **here**

This publication does not have a doi, so we cannot provide a link to the original source

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information

This pubication does not have a URL associated with it.

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.

@INPROCEEDINGS{2007-394-401-P, author = {E. Özcan and A. Alkan},

title = {A Memetic Algorithm for Solving a Timetabling Problem:An Incremental Strategy},

booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},

year = {2007},

editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},

pages = {394--401},

note = {Paper},

abstract = {Timetabling problems are well known complicated constraint satisfaction problems. A new realworld course timetabling problem is described in this study. The difficulty in approximating to an optimal solution in a reasonable time increases for the large problem instances regardless of the algorithm used. An incremental strategy that aims to relieve this difficulty to some extent combined with a memetic algorithm (MA) is investigated for solving the new timetabling problem. The incremental MA is a multistage approach that enlarges the size of the candidate solutions by adding a selected subset of unscheduled course meetings at a stage. A solution is then sought for all the course meetings at hand. The initial results show that the incremental MA is promising.},

owner = {user},

timestamp = {2012.05.21},

webpdf = {2007-394-401-P.pdf} }