References
- J. H. Holland, Adaptation Naturat and Artificial Systems,Ann Arbor, University of Michigan Press, 1975
- D. E. Goldberg, Genetic Algorithms in Search,Optimization, and Machine Learnmg, Addision-Wesley,1989
- Z. Michalewicz, Genetic Atgorithms + Data StructuresEvolution Programs, Springer Verlag, 1995
- B. Sareni, L. Krahenbuhl, 'Fitness sharing and nichingmethods revisited,' IEEE Trans. on Evolutionary Computation, vol. 2, no. 3, PP. 97-106, 1998 https://doi.org/10.1109/4235.735432
- K. A. DeJong, 'An analysis of the behavior of a classof genetic adaptative systems,' Ph.D. dissertation, Univ.of Michigan, Ann Arbor, 1975
- S. W. Mahfoud, 'Niching methodsalgorithm,' Ph.D. dissertation, Univ. Urbana-Champaign, 1995
- G. Harik, 'finding multimodal solutions using restrictedtournament selection,' Proc. of I 996 IEEE Int. Conf.Genetic Algorithm, pp. 24-31, 1995
- P. J. Darwen, X. Yao. 'Speciation as automaticcategorical modularization,' IEEE Trans. on EvoIutionary Computation, vol. 1, no. 2, pp. 101-108, 1997 https://doi.org/10.1109/4235.687878
- I. Harvey, 'Evolutionary robotics and SAGA: the casefor hill crawling and tournament selection,' ArlificialLife Ill, Addison Wesley, 1993
- A. Thompson, 'An evolved circuit, intrinsic in silicon, entwined with physics,' Evolvable Systems: From BioIogy to Hardware, no. 1259 of LNCS, pp. 390-405, 1997
- J.R. Koza, 'Genetic evolution and co-evolution ofcomputer programs,' Arttftcial Life II, Addison Wesley,1991
- H. Tamaki, and Y. Nishikawa, 'A paralleled geneticalgorithm based on a neighborhood model and itsapplication to the job shop scheduling,' ParallelProbtem Solving from Nature 2, Elsevier SciencePublishers, 1992
- M. G. Schleuter,, 'ASPARAGOS: An asynchronousparallel genetic optimization strategy,' Proc. 3rd Int.Conf. Genetic AIgorithms, Morgan Kaufman, 1989
- K. A. DeJong, and W. M. Spears, 'Using geneticalgorithms to solve np-complete problems,' Proc. of the3rd ICGA, pp. 124-132, 1989