Extrapolation-directed crossover for real-coded GA: overcoming deceptive phenomena by extrapolative search

Author

Sakuma, Jun ; Kobayashi, S.

Author_Institution

Tokyo Inst. of Technol., Yokohama

Volume

1

fYear

2001

fDate

2001

Firstpage

655

Abstract

Proposes a new real-coded genetic algorithm (GA) using the combination of two crossovers: UNDX-m (unimodal normal distribution crossover - modified) and EDX (extrapolation-directed crossover). The search region of UNDX-m tends to be biased toward the inside of the area that the population of the GA covers. Because of this search bias, the GA using UNDX-m causes stagnation of its search if the cost surface has a certain kind of structure - viz. the so-called ridge structure or multiple-peak structure. In order to compensate for this fault of UNDX-m, we propose a new crossover - EDX - which has an extrapolative search area, and we show its effectiveness through numerical experiments

Keywords

extrapolation; genetic algorithms; mathematical operators; mathematics computing; numerical analysis; search problems; EDX; UNDX-m; biased search region; cost surface structure; crossover operators; deceptive phenomena; extrapolation-directed crossover; extrapolative search; extrapolative search area; multiple-peak structure; numerical experiments; real-coded genetic algorithm; ridge structure; search stagnation; unimodal normal distribution crossover; Concrete; Cost function; Distribution functions; Genetic mutations; Gradient methods; Guidelines; Optimization methods; Robustness; Statistics; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2001. Proceedings of the 2001 Congress on

Conference_Location

Seoul

Print_ISBN

0-7803-6657-3

Type

conf

DOI

10.1109/CEC.2001.934454

Filename

934454