Solving the university course timetabling problem by hypercube framework for ACO

Miguel Rubio L. Jose, BRODERICK CRAWFORD LABRIN, Johnson P. Franklin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

We present a resolution technique of the University Course Timetabling Problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We show the structure of the problem and the design of resolution using this framework. A simplification of the UCTP problem is used, involving three types of hard restrictions and three types of soft restrictions. We solve experimental instances and competition instances, the results are presented of comparative form to other techniques. We present an appropriate construction graph and pheromone matrix representation. Finally the conclusions are given.

Original languageEnglish
Title of host publicationICEIS 2008 - Proceedings of the 10th International Conference on Enterprise Information Systems
Pages531-534
Number of pages4
StatePublished - 1 Dec 2008
EventICEIS 2008 - 10th International Conference on Enterprise Information Systems - Barcelona, Spain
Duration: 12 Jun 200816 Jun 2008

Publication series

NameICEIS 2008 - Proceedings of the 10th International Conference on Enterprise Information Systems
VolumeAIDSS

Conference

ConferenceICEIS 2008 - 10th International Conference on Enterprise Information Systems
CountrySpain
CityBarcelona
Period12/06/0816/06/08

Keywords

  • Ant colony optimization
  • Ant systems
  • University course timetabling problem

Cite this