Collective Adaptation: The Exchange of Coding Segments

Coding segments are those subsegments of the chromosome that contribute positively to the fitness evaluation of the chromosome. Clique detection is a NP-complete problem in which we can detect such coding segments. We extract coding segments from chromosomes, and we investigate the duplication of coding segments inside the chromosome and the collection of coding segments outside of the chromosome. We find that duplication of coding segments inside the chromosomes provides a back-up mechanism for the search heuristics. We further find local search in a collective memory of coding segments outside of the chromosome, collective adaptation, enables the search heuristic to represent partial solutions that are larger than realistic chromosomes lengths and to express the solution outside of the chromosome.

[1]  Melanie Mitchell,et al.  The royal road for genetic algorithms: Fitness landscapes and GA performance , 1991 .

[2]  David S. Johnson,et al.  Dimacs series in discrete mathematics and theoretical computer science , 1996 .

[3]  Tad Hogg,et al.  Solving the Really Hard Problems with Cooperative Search , 1993, AAAI.

[4]  Emanuel Falkenauer,et al.  Solving Equal Piles with the Grouping Genetic Algorithm , 1995, ICGA.

[5]  Una-May O'Reilly,et al.  An analysis of genetic programming , 1995 .

[6]  John R. Koza,et al.  Two Ways of Discovering the Size and Shape of a Computer Program to Solve a Problem , 1995, ICGA.

[7]  Roger L. Wainwright,et al.  Type inheritance in strongly typed genetic programming , 1996 .

[8]  Thomas Haynes,et al.  Duplication of Coding Segments in Genetic Programming , 1996, AAAI/IAAI, Vol. 1.

[9]  Annie S. Wu,et al.  Empirical Studies of the Genetic Algorithm with Noncoding Segments , 1995, Evolutionary Computation.

[10]  Terence Soule,et al.  Genetic Algorithm Hardness Measures Applied to the Maximum Clique Problem , 1997, ICGA.

[11]  Walter Alden Tackett,et al.  Mining the Genetic Program , 1995, IEEE Expert.

[12]  T. Soule,et al.  Using genetic programming to approximate maximum clique , 1996 .

[13]  Sandip Sen,et al.  Strongly Typed Genetic Programming in Evolving Cooperation Strategies , 1995, ICGA.

[14]  David S. Johnson,et al.  Cliques, Coloring, and Satisfiability , 1996 .

[15]  Lawrence Davis,et al.  Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints , 1993, ICGA.

[16]  Sandip Sen,et al.  Collective adaptation: the sharing of building blocks , 1998 .

[17]  Tad Hogg,et al.  Expected Gains from Parallelizing Constraint Solving for Hard Problems , 1994, AAAI.

[18]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[19]  Thang Nguyen Bui,et al.  A Hybrid Genetic Algorithm for the Maximum Clique Problem , 1995, ICGA.

[20]  Justinian P. Rosca,et al.  Discovery of subroutines in genetic programming , 1996 .

[21]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[22]  Justinian P. Rosca,et al.  Causality in Genetic Programming , 1995, International Conference on Genetic Algorithms.

[23]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[24]  James R. Levenick Inserting Introns Improves Genetic Algorithm Success Rate: Taking a Cue from Biology , 1991, ICGA.

[25]  P. Nordin,et al.  Explicitly defined introns and destructive crossover in genetic programming , 1996 .

[26]  Thomas Haynes,et al.  Phenotypical Building Blocks for Genetic Programming , 1997, ICGA.

[27]  Pedro S. de Souza,et al.  Genetic Algorithms in Asynchronous Teams , 1991, ICGA.

[28]  Walter Alden Tackett,et al.  Genetic Programming for Feature Discovery and Image Discrimination , 1993, ICGA.

[29]  Peter J. Angeline,et al.  Genetic programming and emergent intelligence , 1994 .

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[32]  Sarosh Talukdar,et al.  Asynchronous Procedures for Parallel Processing , 1983, IEEE Transactions on Power Apparatus and Systems.

[33]  L. Altenberg The evolution of evolvability in genetic programming , 1994 .