Solving timetabling problems using a cultural algorithm

doi:10.1016/j.asoc.2009.11.024

2011-01-01

PRE

Ricardo Landa Becerra

Cristina Riff, Maria *

Carlos A. Coello Coello

DOI：10.1016/j.asoc.2009.11.024

原文链接

原文求助

摘要

En 中文

This paper addresses the solution of timetabling problems using cultural algorithms. The core idea is to extract problem domain information during the evolutionary search, and then combine it with some previously proposed operators, in order to improve performance. The proposed approach is validated using a benchmark of 20 instances, and its results are compared with respect to three other approaches: two evolutionary algorithms and simulated annealing, all of which have been previously adopted to solve timetabling problems. (C) 2009 Elsevier B.V. All rights reserved.

Keyword:

Cultural algorithms

Metaheuristics

Parameter control