Browse > Article
http://dx.doi.org/10.5391/IJFIS.2003.3.2.233

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)
Publication Information
International Journal of Fuzzy Logic and Intelligent Systems / v.3, no.2, 2003 , pp. 233-238 More about this Journal
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
species adaptation; genetic algorithms; optimization problem; mutation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 G. Harik, 'finding multimodal solutions using restrictedtournament selection,' Proc. of I 996 IEEE Int. Conf.Genetic Algorithm, pp. 24-31, 1995
2 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
3 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
4 K. A. DeJong, and W. M. Spears, 'Using geneticalgorithms to solve np-complete problems,' Proc. of the3rd ICGA, pp. 124-132, 1989
5 J. H. Holland, Adaptation Naturat and Artificial Systems,Ann Arbor, University of Michigan Press, 1975
6 K. A. DeJong, 'An analysis of the behavior of a classof genetic adaptative systems,' Ph.D. dissertation, Univ.of Michigan, Ann Arbor, 1975
7 J.R. Koza, 'Genetic evolution and co-evolution ofcomputer programs,' Arttftcial Life II, Addison Wesley,1991
8 P. J. Darwen, X. Yao. 'Speciation as automaticcategorical modularization,' IEEE Trans. on EvoIutionary Computation, vol. 1, no. 2, pp. 101-108, 1997   DOI   ScienceOn
9 I. Harvey, 'Evolutionary robotics and SAGA: the casefor hill crawling and tournament selection,' ArlificialLife Ill, Addison Wesley, 1993
10 M. G. Schleuter,, 'ASPARAGOS: An asynchronousparallel genetic optimization strategy,' Proc. 3rd Int.Conf. Genetic AIgorithms, Morgan Kaufman, 1989
11 B. Sareni, L. Krahenbuhl, 'Fitness sharing and nichingmethods revisited,' IEEE Trans. on Evolutionary Computation, vol. 2, no. 3, PP. 97-106, 1998   DOI   ScienceOn
12 Z. Michalewicz, Genetic Atgorithms + Data StructuresEvolution Programs, Springer Verlag, 1995
13 S. W. Mahfoud, 'Niching methodsalgorithm,' Ph.D. dissertation, Univ. Urbana-Champaign, 1995
14 D. E. Goldberg, Genetic Algorithms in Search,Optimization, and Machine Learnmg, Addision-Wesley,1989