Abstract
When a Genetic Algorithm is used to tackle a constrained problem, it is necessary to set a penalty weight for each constraint type, so that, if the individual violates a given constraint it will be penalized accordingly. Traditionally, penalty weights remain static throughout the generations. This paper presents an approach to allow the adaptation of weights, where the penalty function takes feedback from the search process. Although, the idea is not new since other related approaches have been reported in the literature, the work presented here considers problems which contain several kinds of constraints. The method is successfully tested for the congress timetabling problem, a difficult problem and with many practical applications. Further analysis is presented to support the efficiency of the technique.
This is a preview of subscription content, log in via an institution to check access.
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
Goldberg, D.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Company, Inc, Reading (1989)
Mitchell, M.: An Introduction to Genetic Algorithms: Complex Adaptive Systems. MIT Press, Cambridge (1998)
Sarker, R., Mohammadian, M., Xin, Y.: Evolutionary Optimization. Kluwer International Series, Dordrecht (2002)
Michalewicz, Z., Schmidt, M.: Evolutionary algorithms and constrained optimization. In: Sarker, R., Mohammadian, M., Xin, Y. (eds.) Evolutionary Optimization, pp. 57–86 (2002)
Hamda, H., Schoenauer, M.: Adaptive techniques for evolutionary topological optimum design. In: ACDM 2000 (2000)
Hamida, S.B., Schoenauer, M.: An Adaptive Algorithm for Constrained Optimization Problems. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 529–538. Springer, Heidelberg (2000)
Lee, J., Fanjiang, Y., Lai, L.: A software engineering approach to university timetabling. In: International Symposium on Multimedia Software Engineering, pp. 124–131 (2000)
Terashima, H.: Combinations of GAS and CSP strategies for solving examination timetabling problems. PhD thesis, Instituto Tecnologico y de Estudios Superiores de Monterrey (October 1998)
Schaerf, A.: A Survey of Automated Timetabling. Artificial Intelligence Review 13, 87–127 (1999)
Davis, L.: Handbook of Genetic Algorithms. Thompson Computer Press (1996)
Eiben, A.E., van der Hauw, J.K., van Hemert, J.I.: Graph Coloring with Adaptive Evolutionary Algorithms. Journal of Heuristics 4(1), 25–46 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huerta-Amante, D.Á., Terashima-Marín, H. (2004). Adaptive Penalty Weights When Solving Congress Timetabling. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-30498-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23806-5
Online ISBN: 978-3-540-30498-2
eBook Packages: Springer Book Archive