Conjugate schema and basis representation of crossover and mutation operators

Evolutionary Computation

Volumn 6, Issue 2, 1998, Pages 129-160

  Kazadi, Sanza T ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Conjugate schema; Genetic algorithm; Representation

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; COMPUTER SIMULATION; CROSSING OVER; MATHEMATICS; MUTATION; PHYSICS;

ALGORITHMS; COMPUTER SIMULATION; CROSSING OVER, GENETIC; MATHEMATICS; MODELS, GENETIC; MUTATION; PHYSICS;

EID: 0032082586     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/evco.1998.6.2.129     Document Type: Article

References (19)

1. Arabas, J., Mulawka, J., & Pokraniewicz, J. (1995). A new class of the crossover operators for the numerical optimization. In L. Eshelman (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms (pp. 42-47). San Mateo, CA: Morgan Kaufmann.
2. Battle, D., & Vose, M. (1993). Isomorphisms of genetic algorithms. Artificial Intelligence, 60, 155-165.
3. Davis, L. (1991). Hybridization and numerical representation. In L. Davis (Ed.), The Handbook of Genetic Algorithms (pp. 61-71). New York, NY: Van Nostrand Reinhold.
4. Eshelman, L., & Schaffer, D. (1993). Real-coded genetic algorithms and interval schemata. In D. Whitley (Ed.), Foundations of Genetic Algorithms 2 (pp. 187-202). San Mateo, CA: Morgan Kaufmann.
5. Forrest, S., & Mitchell, M. (1992). Towards a stronger building-blocks hypothesis: Effects of relative building-block fitness on GA performance, Technical Report SFI-TR-92-06-029, Santa-Fe Institute.
6. Holland, J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press.
7. Kazadi, S. (1997). Conjugate schema in genetic search. In T. Bäck (Ed.), Proceedings of the Seventh International Conference on Genetic Algorithms (pp. 10-17). San Mateo, CA: Morgan Kaufmann.
8. Koonin, S. (1986). Computational physics. Menlo Park, CA: Benjamin Cummings.
9. Leipins, G., & Vose, D. (1990). Representational issues in genetic optimization. Journal of Experimental Theoretical Artificial Intelligence, 2, 101-115.
10. Michalewicz, Z., & Schoenauer, M. (1996). Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation, 4(1), 1-32.
11. Ono, I., & Kobayashi, S. (1997). A real-coded genetic algorithm for function optimization. In T. Bäck (Ed.), Proceedings of the Seventh International Conference on Genetic Algorithms (pp. 246-253). San Mateo, CA: Morgan Kaufmann.
12. Page, S., & Hong, L. (1998). Diversity and optimality. Mimeographed article. University of Iowa, Department of Economics.
13. Rana, S., & Whitley, L. D. (1997). Bit representations with a twist. In T. Bäck (Ed.), Proceedings of the Seventh International Conference on Genetic Algorithms (pp. 188-195). San Mateo, CA: Morgan Kaufmann.
14. Smith, J., & Fogarty, T. C. (1995). An adaptive poly-parental recombination strategy. In T. C. Fogarty (Ed.), Lecture Notes in Computer Science 993 Evolutionary Computing (pp. 48-61). New York, NY: Springer-Verlag.
15. Syswerda, G. (1993). Uniform crossover in genetic algorithms. In D. Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms (pp. 2-9). San Mateo, CA: Morgan Kaufmann.
16. Tsutsui, S., Fujimoto, Y., & Ghosh, A. (1997). Forking genetic algorithms: GAs with search space division schemes. Evolutionary Computation, 5(1), 61-80.
17. Vose, M. (1991). Generalizing the notion of schema in genetic algorithms. Artificial Intelligence, 50, 385-396.
18. Wright, A. (1991). Genetic algorithms for real parameter optimization. In G. Rawlins (Ed.), Foundations of Genetic Algorithms (pp. 205-218). San Mateo, CA: Morgan Kaufmann.
19. Wu, A., & Lindsay, R. (1996). A comparison of the fixed and floating building block representation in the genetic algorithm. Evolutionary Computation, 4(2), 169-193.