Effect of Changing the Basis in Genetic Algorithms Using Binary Encoding

被引：8

作者：

Kim, Yong-Hyuk ^{[2
]}

Yoon, Yourim ^{[1
]}

机构：

[1] Seoul Natl Univ, Sch Engn & Comp Sci, Seoul 151744, South Korea

[2] Kwangwoon Univ, Dept Comp Sci & Engn, Seoul 139701, South Korea

来源：

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS | 2008年 / 2卷 / 04期

关键词：

Genetic algorithms; binary encoding; change of basis; coordinate-change; non-singular binary matrix;

D O I：

10.3837/tiis.2008.04.002

中图分类号：

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

学科分类号：

0812 ;

摘要：

We examine the performance of genetic algorithms using binary encoding, with respect to a change of basis. Changing the basis can result in a change in the linkage structure inherent in the fitness function. We test three simple functions with differing linkage strengths and analyze the results. Based on an empirical analysis, we show that a better basis results in a smoother fitness landscape, hence genetic algorithms based on the new encoding method provide better performance.

引用

页码：184 / 193

页数：10

共 13 条

[1]

Anderson M., 1998, Math. Mag., V71, P300, DOI [10.1080/0025570X.1998.11996658, DOI 10.1080/0025570X.1998.11996658]

[2]

[Anonymous], 1994, ALGEBRAIC GRAPH THEO

[3]

Brualdi R. A., 1991, COMBINATORIAL MATRIX, V39

[4]

Bui TN, 1996, IEEE T COMPUT, V45, P841, DOI 10.1109/12.508322

[5]

Chryssomalakos C, 2004, LECT NOTES COMPUT SC, V3102, P1018

[6]

Diestel R., 2010, GRAPH THEORY

[7]

Friedberg S.H., 1997, LINEAR ALGEBRA, Vfourth

[8]

Hwang I, 2006, GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, P1209

[9]

KAUFFMAN SA, 1989, LECT SCI COMPLEXITY, P527

[10]

Kim YH, 2003, LECT NOTES COMPUT SC, V2723, P1112

← 1 2 →