Solving the balanced academic curriculum problem using the ACO metaheuristic

dc.contributor.author	Rubio J.-M.
dc.contributor.author	Palma W.
dc.contributor.author	Rodriguez N.
dc.contributor.author	Soto R.
dc.contributor.author	Crawford B.
dc.contributor.author	Paredes F.
dc.contributor.author	Cabrera G.
dc.date.accessioned	2020-09-02T22:27:31Z
dc.date.available	2020-09-02T22:27:31Z
dc.date.issued	2013
dc.identifier	10.1155/2013/793671
dc.identifier.citation	2013, , -
dc.identifier.issn	1024123X
dc.identifier.uri	https://hdl.handle.net/20.500.12728/6100
dc.description	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.
dc.language.iso	en
dc.title	Solving the balanced academic curriculum problem using the ACO metaheuristic
dc.type	Article

Repositorio Académico