Solving timetabling problems using a cultural algorithm

  • Authors:
  • Carlos Soza;Ricardo Landa Becerra;María Cristina Riff;Carlos A. Coello Coello

  • Affiliations:
  • Universidad Técnica Federico Santa María, Departamento de Informática, Av. España No. 1680, Valparaíso, Chile;CINVESTAV Tamaulipas, Laboratorio de Tecnologías de Información, Parque Científico y Tecnológico Tecnotam, Km. 5.5 carretera Victoria-Soto La Marina, Victoria Tamaulipas, 87130 ...;Universidad Técnica Federico Santa María, Departamento de Informática, Av. España No. 1680, Valparaíso, Chile;CINVESTAV-IPN (Evolutionary Computation Group), Departamento de Computación, Av. Instituto Politécnico Nacional No. 2508, Col. San Pedro Zacatenco, México D.F. 07300, Mexico

  • Venue:
  • Applied Soft Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.