A new algorithm of evolutionary computation: bio-simulated optimization

  • Authors:

  • Yong Wang;Ruijun Zhang;Qiumei Pu;Qianxing Xiong

  • Affiliations:

  • School of Management, Wuhan University of Science and Technology, Wuhan, China;School of Management, Wuhan University of Science and Technology, Wuhan, China;School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China;School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China

  • Venue:
  • ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Genetic algorithm (GA), evolutionary programming (EP) and evolutionary strategy (ES) are called the three kinds of evolutionary computation methods. They have been widely used in many engineering fields. However, selecting individuals directly and random search lead to produce premature problem, and requirement for high precision decreases the search efficiency, these become the obstructs of application in engineering practice. This paper proposes a new algorithm of evolutionary computation, it is called bio-simulated optimization algorithm (BSO). BSO reproduces new generation through asexual propagation and sexual propagation. Here, the evolutionary operators effectively solve the problem of premature convergence. Furthermore, performance of global search and convergence are proved theoretically. Finally, Compared BSO with GA and EP in searching the optimal solution of a continuous multi-peaks function, three kinds of computation procedures are run in Matlab, the result shows that performance of BSO is superior to GA and EP.