How to control search step size in fast evolutionary programming

Yong LIU, Xin YAO

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

14 Citations (Scopus)

Abstract

This paper investigates three approaches to controlling the search step size in fast evolutionary programming (FEP): the first approach is based on using the different parameters in a Cauchy mutation; the second approach is through mixing different mutation operators; and the third approach is by applying cooperative coevolution in FEP. Experimental studies on some function optimization problems have shown that the three approaches can help FEP find better solutions while FEP maintains its fast convergence rate. © 2002 IEEE.
Original languageEnglish
Title of host publicationProceedings of the 2002 Congress on Evolutionary Computation, CEC 2002
PublisherIEEE Computer Society
Pages652-656
Number of pages5
Volume1
DOIs
Publication statusPublished - 25 Jun 2003
Externally publishedYes

Fingerprint

Dive into the research topics of 'How to control search step size in fast evolutionary programming'. Together they form a unique fingerprint.

Cite this