Forking genetic algorithms: GAs with search space division schemes

Evolutionary Computation

Volumn 5, Issue 1, 1997, Pages 61-80

  Tsutsui, Shigeyoshi ^a   Ghosh, Ashish ^b   Fujimoto, Yoshiji ^c  

^a HANNAN UNIVERSITY   (Japan)

^b INDIAN STATISTICAL INSTITUTE   (India)

^c RYUKOKU UNIVERSITY   (Japan)

Author keywords

Forking genetic algorithm; Genotypic forking; Multipopulation genetic algorithm; Neighborhood hypercube; Phenotypic forking; Salient schema; Search space division

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; COMPARATIVE STUDY; EVOLUTION; GENOTYPE; PHENOTYPE;

ALGORITHMS; EVOLUTION; GENOTYPE; MODELS, GENETIC; PHENOTYPE;

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

References (18)

1. Beasley, D., Bull, D. R., & Martin, R. R. (1993). A sequential niche technique for multimodal function optimization. Evolutionary Computation, 1(2), 101-125.
2. Deb, K., & Goldberg, D. E. (1989). An investigation of niche and species formation in genetic function optimization. In J. D. Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms (pp. 42-50). San Mateo, CA: Morgan Kaufmann.
3. De Jong, K. (1975). Analysis of the behavior of a class of genetic adaptive systems. PhD dissertation. Department of Computer and Communication Sciences. University of Michigan, Ann Arbor.
4. Eshelman, L. J. (1991). The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In G. J. E. Rawlins (Ed.), Foundations of genetic algorithms (pp. 265-283). San Mateo, CA: Morgan Kaufmann.
5. Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison-Wesley.
6. Goldberg, D. E., & Deb, K. (1991). A comparative analysis of selection schemes used in genetic algorithms. In G. J. E. Rawlins (Ed.), Foundations of genetic algorithms (pp. 69-93). San Mateo, CA: Morgan Kaufmann.
7. Goldberg, D. E., Korb, B., & Deb, K. (1989). Messy genetic algorithms: motivation, analysis, and first results. Complex Systems, 3, 493-530.
8. Goldberg, D. E., Deb, K., & Korb, B. (1990). Messy genetic algorithms revisited: Studies in mixed size and scale. Complex Systems, 4, 415-444.
9. Grefenstette, J. J., Davis, L., & Cerys, D. (1991). GENESIS and OOGA: Two GA systems. Melrose, MA: TSP Publications.
10. Mathias, K., & Whitley, D. (1994a). Initial performance comparisons for the delta coding algorithm. In J. D. Schaffer (Ed.), Proceedings of the IEEE International Conference on Evolutionary Computation (pp. 433-438). Piscataway, NJ: IEEE Press.
11. Mathias, K., & Whitley, D. (1994b). Changing representations during search: A comparative study of delta coding. Evolutionary Computation, 2(3), 249-278.
12. Peck, C. C., & Dhawan, A. P. (1995). Genetic algorithms as global random search methods: An alternative perspective. Evolutionary Computation, 3(1), 39-80.
13. Schraudolph, N. N., & Belew, R. K. (1992). Dynamic parameter encoding for genetic algorithms. Machine Learning, 9, 9-21.
14. Törn, A., & Žilmskas, A. (1989). Methods of generalized descent. In G. Goos & J. Hartmanis (Eds.), Global optimization (p. 186). Berlin: Springer-Verlag (Lecture Notes in Computer Science).
15. Tsutsui, S., & Fujimoto, Y. (1993). Forking genetic algorithm with blocking and shrinking modes. In S. Forrest (Ed.), Proceedings of the Fifth International Conference on Genetic Algorithms (pp. 206-213). San Mateo, CA: Morgan Kaufmann.
16. Tsutsui, S., & Fujimoto, Y. (1995). Phenotypic forking genetic algorithms. In D. Fogel (Ed.), Proceedings of the IEEE International Conference on Evolutionary Computation (pp. 566-572). Piscataway, NJ: IEEE Press.
17. Whitley, D. (1989). The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In J. D. Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms (pp. 116-121). San Mateo, CA: Morgan Kaufmann.
18. Whitley, D. (1991). Fundamental principles of deception in genetic search. In G. J. E. Rawlins (Ed.), Foundations of genetic algorithms (pp. 221-241). San Mateo, CA: Morgan Kaufmann.