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.
|Title of host publication||Cutting-Edge Research Topics on Multiple Criteria Decision Making|
|Subtitle of host publication||20th International Conference, MCDM 2009, Chengdu/Jiuzhaigou, Proceedings|
|Number of pages||9|
|State||Published - 2009|
|Name||Communications in Computer and Information Science|