Solving deceptive problems using a genetic algorithm with reserve selection

Yang Chen; Jinglu Hu; Kotaro Hirasawa; Songnian Yu

doi:10.1109/CEC.2008.4630900

Solving deceptive problems using a genetic algorithm with reserve selection

Yang Chen^*, Jinglu Hu, Kotaro Hirasawa, Songnian Yu

^*この研究の対応する著者

大学院情報生産システム研究科

研究成果: Conference contribution

11 被引用数 (Scopus)

抄録

Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global optimum. This paper presents an improved genetic algorithm with reserve selection to solve deceptive problems. The concept "potential" of individuals is introduced as a new criterion for selecting individuals for reproduction, where some individuals with low fitness are also let survive only if they have high potentials. An operator called adaptation is further employed to release the potentials for approaching the global optimum. Case studies are done in two deceptive problems, demonstrating the effectiveness of the proposed algorithm.

本文言語	English
ホスト出版物のタイトル	2008 IEEE Congress on Evolutionary Computation, CEC 2008
ページ	884-889
ページ数	6
DOI	https://doi.org/10.1109/CEC.2008.4630900
出版ステータス	Published - 2008 11月 14
イベント	2008 IEEE Congress on Evolutionary Computation, CEC 2008 - Hong Kong, China 継続期間: 2008 6月 1 → 2008 6月 6

出版物シリーズ

名前	2008 IEEE Congress on Evolutionary Computation, CEC 2008

Conference

Conference	2008 IEEE Congress on Evolutionary Computation, CEC 2008
国/地域	China
City	Hong Kong
Period	08/6/1 → 08/6/6

ASJC Scopus subject areas

計算理論と計算数学
理論的コンピュータサイエンス

文献へのアクセス

10.1109/CEC.2008.4630900

他のファイルとリンク

引用スタイル

Chen, Y, Hu, J, Hirasawa, K & Yu, S 2008, Solving deceptive problems using a genetic algorithm with reserve selection. in 2008 IEEE Congress on Evolutionary Computation, CEC 2008., 4630900, 2008 IEEE Congress on Evolutionary Computation, CEC 2008, pp. 884-889, 2008 IEEE Congress on Evolutionary Computation, CEC 2008, Hong Kong, China, 08/6/1. https://doi.org/10.1109/CEC.2008.4630900

@inproceedings{462506519b7a4d26be2f2c2c75ed20f7,

title = "Solving deceptive problems using a genetic algorithm with reserve selection",

abstract = "Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global optimum. This paper presents an improved genetic algorithm with reserve selection to solve deceptive problems. The concept {"}potential{"} of individuals is introduced as a new criterion for selecting individuals for reproduction, where some individuals with low fitness are also let survive only if they have high potentials. An operator called adaptation is further employed to release the potentials for approaching the global optimum. Case studies are done in two deceptive problems, demonstrating the effectiveness of the proposed algorithm.",

author = "Yang Chen and Jinglu Hu and Kotaro Hirasawa and Songnian Yu",

year = "2008",

month = nov,

day = "14",

doi = "10.1109/CEC.2008.4630900",

language = "English",

isbn = "9781424418237",

series = "2008 IEEE Congress on Evolutionary Computation, CEC 2008",

pages = "884--889",

booktitle = "2008 IEEE Congress on Evolutionary Computation, CEC 2008",

note = "2008 IEEE Congress on Evolutionary Computation, CEC 2008 ; Conference date: 01-06-2008 Through 06-06-2008",

}

TY - GEN

T1 - Solving deceptive problems using a genetic algorithm with reserve selection

AU - Chen, Yang

AU - Hu, Jinglu

AU - Hirasawa, Kotaro

AU - Yu, Songnian

PY - 2008/11/14

Y1 - 2008/11/14

N2 - Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global optimum. This paper presents an improved genetic algorithm with reserve selection to solve deceptive problems. The concept "potential" of individuals is introduced as a new criterion for selecting individuals for reproduction, where some individuals with low fitness are also let survive only if they have high potentials. An operator called adaptation is further employed to release the potentials for approaching the global optimum. Case studies are done in two deceptive problems, demonstrating the effectiveness of the proposed algorithm.

AB - Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global optimum. This paper presents an improved genetic algorithm with reserve selection to solve deceptive problems. The concept "potential" of individuals is introduced as a new criterion for selecting individuals for reproduction, where some individuals with low fitness are also let survive only if they have high potentials. An operator called adaptation is further employed to release the potentials for approaching the global optimum. Case studies are done in two deceptive problems, demonstrating the effectiveness of the proposed algorithm.

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

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

U2 - 10.1109/CEC.2008.4630900

DO - 10.1109/CEC.2008.4630900

M3 - Conference contribution

AN - SCOPUS:55749088961

SN - 9781424418237

T3 - 2008 IEEE Congress on Evolutionary Computation, CEC 2008

SP - 884

EP - 889

BT - 2008 IEEE Congress on Evolutionary Computation, CEC 2008

T2 - 2008 IEEE Congress on Evolutionary Computation, CEC 2008

Y2 - 1 June 2008 through 6 June 2008

ER -

Solving deceptive problems using a genetic algorithm with reserve selection

抄録

出版物シリーズ

Conference

ASJC Scopus subject areas

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル