DocumentCode
1355660
Title
A new mutation rule for evolutionary programming motivated from backpropagation learning
Author
Choi, Doo-Hyun ; Oh, Se-young
Author_Institution
Sch. of Electr. Eng. & Comput. Sci., Seoul Nat. Univ., South Korea
Volume
4
Issue
2
fYear
2000
fDate
7/1/2000 12:00:00 AM
Firstpage
188
Lastpage
190
Abstract
Evolutionary programming is mainly characterized by two factors: the selection strategy and the mutation rule. This letter presents a new mutation rule that has the same form as the well-known backpropagation learning rule for neural networks. The proposed mutation rule assigns the best individual´s fitness as the temporary target at each generation. The temporal error, the distance between the target and an individual at hand, is used to improve the exploration of the search space by guiding the direction of evolution. The momentum, i.e., the accumulated evolution information for the individual, speeds up convergence. The efficiency and robustness of the proposed algorithm are assessed on several benchmark test functions
Keywords
backpropagation; computational complexity; convergence; evolutionary computation; search problems; accumulated evolution information; algorithm efficiency; algorithm robustness; backpropagation learning; convergence; evolutionary programming; fitness; mutation rule; search space exploration; temporal error; temporary target; Accelerated aging; Backpropagation; Benchmark testing; Convergence; Costs; Evolutionary computation; Genetic mutations; Genetic programming; Neural networks; Robustness;
fLanguage
English
Journal_Title
Evolutionary Computation, IEEE Transactions on
Publisher
ieee
ISSN
1089-778X
Type
jour
DOI
10.1109/4235.850659
Filename
850659
Link To Document