DocumentCode
3256723
Title
Evolutionary algorithms with a coarse-to-fine function smoothing
Author
Yang, Dekun ; Flockton, Stuart J.
Author_Institution
Dept. of Phys., London Univ., UK
Volume
2
fYear
1995
fDate
29 Nov-1 Dec 1995
Firstpage
657
Abstract
A coarse-to-fine function smoothing method is presented for improving traditional evolutionary algorithms in function optimization. The method is motivated by the need of suppressing the local optima without distorting the location of the global optimum. By embedding the method into a traditional evolutionary algorithm, optimization is performed by running the evolutionary algorithm in each smoothed function from coarse level to fine level in which the output of the coarse level is used to guide the search process in the finer level. Simulations show that the method can improve traditional evolutionary algorithms in locating the global optimum of a given function
Keywords
function approximation; genetic algorithms; simulation; smoothing methods; coarse level output; coarse-to-fine function smoothing; evolutionary algorithms; function optimization; global optimum; local optima suppression; search process; simulations; Biological system modeling; Context modeling; Evolutionary computation; Genetic mutations; Nonlinear distortion; Optimization methods; Physics; Smoothing methods; Space exploration; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1995., IEEE International Conference on
Conference_Location
Perth, WA
Print_ISBN
0-7803-2759-4
Type
conf
DOI
10.1109/ICEC.1995.487462
Filename
487462
Link To Document