When sharing fails

被引：0

作者：

Ursem, RK ^{[1
]}

机构：

[1] Aarhus Univ, Dept Comp Sci, EvALife Project Grp, DK-8000 Aarhus C, Denmark

来源：

PROCEEDINGS OF THE 2001 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2 | 2001年

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Sharing, introduced by Goldberg and Richardson in 1987, is probably one of the most investigated ideas for multimodal optimization. Empirical tests have indicated that sharing is capable of maintaining multiple peaks located simultaneously - a feature that allows a final human selection among the found solutions. In this paper I present a theoretical argument regarding the performance of sharing. The argument is supported with a series of tests on variants of a simple problem, which is one of Goldberg and Richardson's original test function where a constant is added. The results from these tests indicated that sharing is very sensitive to the range of fitness values. Finally, three extensions of sharing are proposed and discussed.

引用

页码：873 / 879

页数：7

共 13 条

[1]

[Anonymous], 92004 ILLIGAL

[2]

DEB K, 1989, PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P42

[3]

DEJONG KA, 1975, THESIS U MICHIGAN AN

[4]

Goldberg D. E., 1987, Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, P41

[5]

GOLDBERG DE, 1997, 97007 U ILL ILL GEN

[6] Genetic algorithms with dynamic niche sharing for multimodal function optimization [J].

Miller, BL ;

Shaw, MJ .

1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, :786-791

[7]

Oei C, 1991, 91011 ILLIGAL

[8]

Oppacher F, 1999, GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, P504

[9]

Petrowski A., 1997, P 7 INT C GEN ALG, P144

[10]

TSUTSUI S, 1993, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P206

← 1 2 →