Genetic algorithms are often well suited for optimization problems because of their parallel searching and evolutionary ability. Crossover and mutation are believed to be the main exploration operators. In this paper, we focus on how crossover and mutation work in binary-coded genetic algorithm and investigate their effects on bit's frequency of population. According to the analysis of equilibrium of crossover, we can see the bit-based simulated crossover (BSC) is strong crossover method. Furthermore, to increase robustness of binary-coded genetic algorithm, multi-generation inheritance evolutionary strategy(MGIS) was proposed. Simulation results demonstrate the effectiveness of the proposed method.
|Number of pages||6|
|Journal||IEEJ Transactions on Electronics, Information and Systems|
|Publication status||Published - Jan 2003|
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering