Abstract
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.
Original language | English |
---|---|
Article number | 793671 |
Journal | Mathematical Problems in Engineering |
Volume | 2013 |
DOIs | |
State | Published - 2013 |