A timetabling applied case solved with ant colony optimization
Autor
Crawford B.
Soto R.
Johnson F.
Paredes F.
Resumen
This research present an applied case of the resolution of a timetabling problem called the University course Timetabling problem (UCTP), the resolution technique used is based in Ant Colony Optimization metaheuristic. Ant Colony Optimization is a Swarm Intelligence technique which inspired from the foraging behavior of real ant colonies. We propose a framework to solve the University course Timetabling problem effectively. We show the problem and the resolution design using this framework. First we tested our proposal with some competition instances, and then compare our results with other techniques. The results show that our proposal is feasible and competitive with other techniques. To evaluate this framework in practice way, we build a real instance using the case of the school of Computer Science Engineering of the Pontifical Catholic University of Valparaíso and the Department of Computer Engineering at Playa Ancha University. © Springer International Publishing Switzerland 2015.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
A new approach to solve the software project scheduling problem based on max–min ant system (2020)
Crawford B.; Soto R.; Johnson F.; Monfroy E.; Paredes F. (Springer Verlag, 2014) -
Conference Paper
An artificial bee colony algorithm for the set covering problem (2020)
Cuesta R.; Crawford B.; Soto R.; Paredes F. (Springer Verlag, 2014) -
Conference Paper
Online control of enumeration strategies via bat-inspired optimization (2020)
Soto R.; Crawford B.; Olivares R.; Johnson F.; Paredes F. (Springer Verlag, 2015)