We deal with the Balanced Academic Curriculum Problem, a real world problem that is currently part of CSPLIB. We introduce a Genetic Local Search algorithm to solve this problem using two objectives which is a more realistic model than the one we used in our previous research. The tests carried out show that our algorithm obtains better solutions than systematic search techniques in the same amount of time. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Castro, C., Crawford, B., & Monfroy, E. (2009). A genetic local search algorithm for the multiple optimisation of the balanced academic curriculum problem. In Communications in Computer and Information Science (Vol. 35, pp. 824–832). Springer Verlag. https://doi.org/10.1007/978-3-642-02298-2_119
Mendeley helps you to discover research relevant for your work.