International Journal of Fuzzy Logic and Intelligent Systems

Korean Institute of Intelligent Systems (한국지능시스템학회)
권호 표지
DOI QR코드

DOI QR Code

Species Adaptation Evolutionary Algorithm for Solving the Optimization Problems

  • Lee, Dong-Wook (School of Electrical and Electronic Engineering, Chung-Ang University) ;
  • Sim, Kwee-Bo (School of Electrical and Electronic Engineering, Chung-Ang University)
  • Published : 2003.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

Living creatures maintain their variety through speciation, which helps them to have more fitness for an environment. So evolutionary algorithm based on biological evolution must maintain variety in order to adapt to its environment. In this paper, we utilize the concept of speciation. Each individual of population creates their offsprings using mutation, and next generation consists of them. Each individual explores search space determined by mutation. Useful search space is extended by differentiation, then population explorers whole search space very effectively. If evolvable hardware evolves through mutation, it is useful way to explorer search space because of less varying inner structure. We verify the effectiveness of the proposed method by applying it to two optimization problems.

Keywords

References

  1. J. H. Holland, Adaptation Naturat and Artificial Systems,Ann Arbor, University of Michigan Press, 1975
  2. D. E. Goldberg, Genetic Algorithms in Search,Optimization, and Machine Learnmg, Addision-Wesley,1989
  3. Z. Michalewicz, Genetic Atgorithms + Data StructuresEvolution Programs, Springer Verlag, 1995
  4. 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
  5. K. A. DeJong, 'An analysis of the behavior of a classof genetic adaptative systems,' Ph.D. dissertation, Univ.of Michigan, Ann Arbor, 1975
  6. S. W. Mahfoud, 'Niching methodsalgorithm,' Ph.D. dissertation, Univ. Urbana-Champaign, 1995
  7. G. Harik, 'finding multimodal solutions using restrictedtournament selection,' Proc. of I 996 IEEE Int. Conf.Genetic Algorithm, pp. 24-31, 1995
  8. 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
  9. I. Harvey, 'Evolutionary robotics and SAGA: the casefor hill crawling and tournament selection,' ArlificialLife Ill, Addison Wesley, 1993
  10. 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
  11. J.R. Koza, 'Genetic evolution and co-evolution ofcomputer programs,' Arttftcial Life II, Addison Wesley,1991
  12. 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
  13. M. G. Schleuter,, 'ASPARAGOS: An asynchronousparallel genetic optimization strategy,' Proc. 3rd Int.Conf. Genetic AIgorithms, Morgan Kaufman, 1989
  14. K. A. DeJong, and W. M. Spears, 'Using geneticalgorithms to solve np-complete problems,' Proc. of the3rd ICGA, pp. 124-132, 1989