Abstract
Our research has been focused on developing techniques for solving binary constraint satisfaction problems (CSP) using evolutionary algorithms, which take into account the constraint graphs topology. In this paper, we introduce a new idea to improve the performance of evolutionary algorithms, that solve complex problems. It is inspired from a real world observation: The ability to evolve for an individual in an environment that changes is not only related to its genetic material. It also comes from what has learned from it parents. The key idea of this paper is to use its inheritance to dynamically improve the way the algorithm creates a new population using a given set of operators. This new dynamic operator selection strategy has been applied to an evolutionary algorithm to solve CSPs, but can be easily extended to other class of evolutionary algorithms. A set of benchmarks shows how the new strategy can help to solve large NP-hard problems with the 3-graph coloring example.
Partially supported by CNRS/CONICYT Collaboration Project France-Chile
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
B. Craenen, A. Eiben, E. Marchiori. Solving Constraint Satisfaction Problems with Heuristic-based Evolutionary Algorithms. In Proceedings of the Congress on Evolutionary Computation, (CEC2000),pages 1571–1577, IEEE Press.
Michalewicz Z., Genetic Algorithms + Data Structures = Evolution Programs. Ed. Springer Verlag, Artificial Intelligence Series, 1994.
Brelaz, New methods to color vertices of a graph. Communications of the ACM, 22,pp. 251–256, 1979.
Cheeseman P., Kanefsky B., Taylor W., Where the Really Hard Problems Are. Proceedings of IJCAI-91, pp. 163–169, 1991
Culberson, J. http://web.cs.ualberta.ca/joe/.
Eiben A.E., Hinterding R., and Michalewicz Z. Parameter Control. Evolutionary Computation 2: Advanced Algorithms and Operators, pages 170–187, Institute of Physics Publishing, 2000.
G. Dozier, J. Bowen, and Homaifar, Solving Constraint Satisfaction Problems Using Hybrid Evolutionary Search, IEEE Transactions on Evolutionary Computation, Vol. 2, No. 1, 1998.
A.E. Eiben, J.I. van Hemert, E. Marchiori, A.G. Steenbeek. Solving Binary Constraint Satisfaction Problems using Evolutionary Algorithms with an Adaptive Fitness Function. Fifth International Conference on Parallel Problem Solving from Nature (PPSN-V), LNCS 1498, pp. 196–205, 1998.
Hinterding, R. Self-adaptation using Multi-chromosmes. Proceedings of the 4th IEEE International Conference on Evolutionary Computation, 1997.
Smith, J.E. and Fogarty T.C. Operator and Parameter Adaptation in Genetic Algorithms. pp81–87, Soft Computing, 1:2, June 1997. Springer Verlag
Mackworth A.K., Consistency in network of relations. Artificial Intelligence, 8:99–118, 1977.
Marchiori E., Combining Constraint Processing and Genetic Algorithms for Constraint Satisfaction Problems. 7th International Conference on Genetic Algorithms (ICGA97), 1997.
Minton S., Integrating heuristics for constraint satisfaction problems: A case study. Proceedings of the Eleventh National Conference on Artificial Intelligence, 1993.
Smith, J.E. and Vavak, F. Replacement strategies in steady state genetic algorithms: dynamic environments, p 49–60 Journal of Computing and Information Technology, Special Issue on Evolutionary Computing. Vol. 7 No. 1. March 1999
Riff M.-C., From Quasi-solutions to Solution: An Evolutionary Algorithm to Solve CSP. Constraint Processing (CP96), Ed. Eugene Freuder, pp. 367–381, 1996.
Riff M.-C., Evolutionary Search guided by the Constraint Network to solve CSP. Proc. of the Fourth IEEE Conf on Evolutionary Computation, Indianopolis, pp. 337–342, 1997.
Riff M.-C., A network-based adaptive evolutionary algorithm for CSP, In the book “Metaheuristics: Advances and Trends in Local Search Paradigms for Optimisation”, Kluwer Academic Publisher, Chapter 22, pp. 325–339, 1998.
Tsang, E.P.K., Wang, C.J., Davenport, A., Voudouris, C., Lau, T.L., A family of stochastic methods for constraint satisfaction and optimization, The First International Conference on The Practical Application of Constraint Technologies and Logic Programming (PACLP), London, pp. 359–383, 1999
Smith, J.E. Modelling GAs with Self Adaptive Mutation Rates, pp 599–606 in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001. San Francisco, CA: Morgan Kaufmann Publishers.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Riff, MC., Bonnaire, X. (2002). Inheriting Parents Operators: A New Dynamic Strategy for Improving Evolutionary Algorithms. In: Hacid, MS., Raś, Z.W., Zighed, D.A., Kodratoff, Y. (eds) Foundations of Intelligent Systems. ISMIS 2002. Lecture Notes in Computer Science(), vol 2366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48050-1_37
Download citation
DOI: https://doi.org/10.1007/3-540-48050-1_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43785-7
Online ISBN: 978-3-540-48050-1
eBook Packages: Springer Book Archive