Solving the balanced academic curriculum problem using the ACO metaheuristic
MetadataShow full item record
The balanced academic curriculum problem consists in the assignation of courses to academic periods satisfying all the load limits and prerequisite constraints. In this paper, we present the design of a solution to the balanced academic curriculum problem based on the ACO metaheuristic, in particular via the Best-Worst Ant System. We provide an experimental evaluation which illustrates the effectiveness of the proposed approach on a set of classic benchmarks as well as on real instances. © 2013 José-Miguel Rubio et al.
Showing items related by title, author, creator and subject.
The impact of a new formulation when solving the set covering problem using the ACO metaheuristic (2020) Crawford B.; Soto R.; Palma W.; Paredes F.; Johnson F.; Norero E. (Springer Verlag, 2015)
A 2-level approach for the set covering problem: Parameter tuning of artificial bee colony algorithm by using genetic algorithm (2020) Crawford B.; Soto R.; Palma W.; Johnson F.; Paredes F.; Olguín E. (Springer Verlag, 2014)
Conference PaperCrawford B.; Soto R.; Peña C.; Palma W.; Johnson F.; Paredes F. (Springer Verlag, 2015)