Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aydin, M., Fogarty, T.: A Distributed Evolutionary Simulated Annealing for Combinatorial Optimisation Problems. J. of Heuristics 10(3), 269–292 (2004)
Aydin, M., Fogarty, T.: A simulated annealing algorithm for multi-agent systems: a job-shop scheduling application. J. of Intell. Manufacturing 15(6), 805–814 (2004)
Castro, C., Manzano, S.: Variable and Value Ordering When Solving Balanced Academic Curriculum Problems. In: 6th Workshop ERCIM 2001, Prague, Czech Republic (June 2001)
Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Hybrid Modelling for Robust Solving. Annals of Operations Research 130(1-4), 19–39 (2004)
Hnich, B., Kiziltan, Z., Walsh, T.: Modelling a Balanced Academic Curriculum Problem. In: 4th Intl. Workshop on Integration of AI and OR Tech. in CP for Combinatorial Opt. Problems, Le Croisic, France, March 2002, pp. 121–132 (2002)
Jeong, I., Lee, J.: Adaptive Simulated Annealing Genetic Algorithm for System Identification. Eng. Applications of Artificial Intelligence 9(5), 523–532 (1996)
Syw, W.: Hybrid simulated annealing/genetic algorithm approach to short term hydro-termal scheduling with multiple thermal plants. Elect. Power and Energy Systems 23, 565–575 (2001)
Vergara, C.: Desarrollo de un Modelo de Programación Lineal para la Generación de Mallas Curriculares Balanceadas. Título IEI, UTFSM, Valpso, Chile (December 1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castro, C., Crawford, B., Monfroy, E. (2009). A Genetic Local Search Algorithm for the Multiple Optimisation of the Balanced Academic Curriculum Problem. In: Shi, Y., Wang, S., Peng, Y., Li, J., Zeng, Y. (eds) Cutting-Edge Research Topics on Multiple Criteria Decision Making. MCDM 2009. Communications in Computer and Information Science, vol 35. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02298-2_119
Download citation
DOI: https://doi.org/10.1007/978-3-642-02298-2_119
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02297-5
Online ISBN: 978-3-642-02298-2
eBook Packages: Computer ScienceComputer Science (R0)