Regresar

Solving the balanced academic curriculum problem using the ACO metaheuristic

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. © 2013 José-Miguel Rubio et al.

Año de publicación:

2013

Keywords:

    Fuente:

    scopusscopus

    Tipo de documento:

    Article

    Estado:

    Acceso abierto

    Áreas de conocimiento:

    • Algoritmo
    • Algoritmo

    Áreas temáticas:

    • Conocimiento

    Contribuidores:

    Rubio J.M.Rubio J.M.
    Paredes F.Paredes F.
    Nibaldo RodríguezNibaldo Rodríguez
    Palma W.Palma W.
    Crawford B.Crawford B.
    Soto R.Soto R.
    Cabrera-Guerrero G.Cabrera-Guerrero G.