Inheriting parents operators: A new dynamic strategy for improving evolutionary algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2366 LNAI, Issue , 2002, Pages 333-341

  Riff, María Cristina ^a   Bonnaire, Xavier ^b  

^a DEPARTAMENTO DE FÍSICA   (Chile)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT SATISFACTION PROBLEMS; INTELLIGENT SYSTEMS; TOPOLOGY; ALGORITHMS; PROBLEM SOLVING;

BINARY CONSTRAINT SATISFACTION; COMPLEX PROBLEMS; CONSTRAINT GRAPH; DYNAMIC OPERATORS; DYNAMIC STRATEGIES; GENETIC MATERIALS; REAL-WORLD;

EVOLUTIONARY ALGORITHMS;

EID: 40649088530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48050-1_37     Document Type: Conference Paper

References (19)

1. 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.
2. Michalewicz Z., Genetic Algorithms + Data Structures = Evolution Programs. Ed. Springer Verlag, Artificial Intelligence Series, 1994.
3. Brelaz, New methods to color vertices of a graph. Communications of the ACM, 22,pp. 251-256, 1979.
4. Cheeseman P.,Kanefsky B., Taylor W., Where the Really Hard Problems Are. Proceedings of IJCAI-91, pp. 163-169, 1991
5. Culberson, J. http://web.cs.ualberta.ca/joe/.
6. 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.
7. G. Dozier, J. Bowen, and Homaifar, Solving Constraint Satisfaction Problems Using Hybrid Evolutionary Search, IEEE Transactions on Evolutionary Computation, Vol. 2, No. 1, 1998.
8. 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.
9. Hinterding, R. Self-adaptation using Multi-chromosmes. Proceedings of the 4th IEEE International Conference on Evolutionary Computation, 1997.
10. Smith, J.E. and Fogarty T.C. Operator and Parameter Adaptation in Genetic Algorithms. pp81-87, Soft Computing , 1:2, June 1997. Springer Verlag
11. Mackworth A.K., Consistency in network of relations. Artificial Intelligence, 8:99-118, 1977.
12. Marchiori E., Combining Constraint Processing and Genetic Algorithms for Constraint Satisfaction Problems. 7th International Conference on Genetic Algorithms (ICGA97), 1997.
13. Minton S., Integrating heuristics for constraint satisfaction problems: A case study. Proceedings of the Eleventh National Conference on Artificial Intelligence, 1993.
14. 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
15. Riff M.-C., From Quasi-solutions to Solution: An Evolutionary Algorithm to Solve CSP. Constraint Processing (CP96), Ed. Eugene Freuder, pp. 367-381, 1996.
16. 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.
17. 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.
18. 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
19. 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.