EVOLUTIONARY STRATEGIES FOR THE ACADEMIC CURRICULUM BALANCED PROBLEM

Lorna V. Rosas-Tellez, Jose L. Martínez-Flores, Vittorio Zanella-Palacios

Abstract

The Balanced Academic Curriculum Problem (BACP) is considered an optimization problem, which consist in the assignment of courses in periods that form an academic curriculum so that the prerequisites are satisfied and the courses load is balanced for students. The BACP is a constraint satisfaction problem classified as NP- Hard. In this paper we present the solution to a modified problem BACP where the loads can be the equals or different for each one of the periods and is allowed to have some courses in a specific period. This problem is modeled as an integer programming problem, for which had been obtained solutions for some of their instances with HyperLingo but not for all. Therefore, we propose the use of evolutionary strategies for its solution. The results obtained for the instances of the modified and the original BACP, proposed in the CSPLib, showing that with the use of evolutionary strategies is possible to find the solution for instances of the problem that with the formal method is not possible to find.

References

  1. Aguilar-Solís J. A., Un modelo basado en optimización para balancear planes de estudio en Instituciones de Educación Superior, PhD Thesis, Puebla: UPAEP, 2008.
  2. Castro, C., Crawford, B., Monfroy, E., A Genetic Local Search Algorithm for the Multiple Optimisation of the Balanced Academic Curriculum Problem, In Proceedings of MCDM, pages 824-832, Berlin: Springer-Verlag, 2009.
  3. Castro, C., Manzano, S., Variable and value ordering when solving balanced academic curriculum problem, Proc. of the ERCIM Working Group on Constraints, 2001.
  4. Di Gaspero, L., Schaerf, A., Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum, In Proceedings of HM, pages 146-157, Berlin: Springer-Verlag, 2008.
  5. Lambert, T., Castro, C., Monfroy, E., Saubion, F., Solving the Balanced Academic Curriculum Problem with an Hybridization of Genetic Algorithm an Constraint Propagation, In Proceedings of ICAISC, pages 410- 419, Berlin: Springer-Verlag, 2006.
  6. Michalewicz, Z., Genetic Algorithms + Data Structures = Evolution Programs, Berlin: Springer-Verlag, 1999.
  7. Salazar, J., Programación matemática, Madrid: Diaz de Santos, 2001.
Download


Paper Citation


in Harvard Style

V. Rosas-Tellez L., L. Martínez-Flores J. and Zanella-Palacios V. (2011). EVOLUTIONARY STRATEGIES FOR THE ACADEMIC CURRICULUM BALANCED PROBLEM . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FEC, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 534-538. DOI: 10.5220/0003723805340538


in Bibtex Style

@conference{fec11,
author={Lorna V. Rosas-Tellez and Jose L. Martínez-Flores and Vittorio Zanella-Palacios},
title={EVOLUTIONARY STRATEGIES FOR THE ACADEMIC CURRICULUM BALANCED PROBLEM},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FEC, (IJCCI 2011)},
year={2011},
pages={534-538},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003723805340538},
isbn={978-989-8425-83-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FEC, (IJCCI 2011)
TI - EVOLUTIONARY STRATEGIES FOR THE ACADEMIC CURRICULUM BALANCED PROBLEM
SN - 978-989-8425-83-6
AU - V. Rosas-Tellez L.
AU - L. Martínez-Flores J.
AU - Zanella-Palacios V.
PY - 2011
SP - 534
EP - 538
DO - 10.5220/0003723805340538