Increasing Robustness of Binary-coded Genetic Algorithm

Jiangming Mao, Junichi Murata, Kotaro Hirasawa, Jinglu Hu

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)1625-1630
Number of pages6
JournalIEEJ Transactions on Electronics, Information and Systems
Volume123
Issue number9
DOIs
Publication statusPublished - Jan 1 2003

Fingerprint

Genetic algorithms

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Increasing Robustness of Binary-coded Genetic Algorithm. / Mao, Jiangming; Murata, Junichi; Hirasawa, Kotaro; Hu, Jinglu.

In: IEEJ Transactions on Electronics, Information and Systems, Vol. 123, No. 9, 01.01.2003, p. 1625-1630.

Research output: Contribution to journalArticle

Mao, Jiangming ; Murata, Junichi ; Hirasawa, Kotaro ; Hu, Jinglu. / Increasing Robustness of Binary-coded Genetic Algorithm. In: IEEJ Transactions on Electronics, Information and Systems. 2003 ; Vol. 123, No. 9. pp. 1625-1630.
@article{a5b5096942824a4eab658b792ab7b29e,
title = "Increasing Robustness of Binary-coded Genetic Algorithm",
abstract = "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.",
author = "Jiangming Mao and Junichi Murata and Kotaro Hirasawa and Jinglu Hu",
year = "2003",
month = "1",
day = "1",
doi = "10.1541/ieejeiss.123.1625",
language = "English",
volume = "123",
pages = "1625--1630",
journal = "IEEJ Transactions on Electronics, Information and Systems",
issn = "0385-4221",
publisher = "The Institute of Electrical Engineers of Japan",
number = "9",

}

TY - JOUR

T1 - Increasing Robustness of Binary-coded Genetic Algorithm

AU - Mao, Jiangming

AU - Murata, Junichi

AU - Hirasawa, Kotaro

AU - Hu, Jinglu

PY - 2003/1/1

Y1 - 2003/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85024719130&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85024719130&partnerID=8YFLogxK

U2 - 10.1541/ieejeiss.123.1625

DO - 10.1541/ieejeiss.123.1625

M3 - Article

AN - SCOPUS:85024719130

VL - 123

SP - 1625

EP - 1630

JO - IEEJ Transactions on Electronics, Information and Systems

JF - IEEJ Transactions on Electronics, Information and Systems

SN - 0385-4221

IS - 9

ER -