AN ANALYSIS OF A REORDERING OPERATOR ON A GA-HARD PROBLEM

被引：25

作者：

GOLDBERG, DE

BRIDGES, CL

机构：

[1] Department of Engineering Mechanics, The University of Alabama, Tuscaloosa, 35487, AL

来源：

BIOLOGICAL CYBERNETICS | 1990年 / 62卷 / 05期

关键词：

D O I：

10.1007/BF00197646

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper analyzes the performance of a genetic algorithm that combines reproduction, crossover, and a reordering operator. Reordering operators have often been suggested as one way to avoid the coding traps - the combinations of loose linkage and deception among important, lower order schemata - of fixed codings. The analysis confirms this role and suggests directions for further research. © 1990 Springer-Verlag.

引用

页码：397 / 405

页数：9

共 14 条

[1] Bethke A. D., 1981, DISS ABSTR INT B, V41
[2] CAVICCHIO D, 1970, THESIS U MICHIGAN
[3] DAVIS D, 1985, ADAPTIVE DESIGN LAYO
[4] Goldberg D. E., 1989, Complex Systems, V3, P153
[5] Goldberg D. E., 1989, Complex Systems, V3, P129
[6] Goldberg D. E., 1987, GENETIC ALGORITHMS S, P74
[7] Goldberg DE, 1989, GENETIC ALGORITHMS S
[8] GOLDBERG DE, 1989, TCGA89003 U AL REP
[9] Goldberg Jr D.E., 1985, P 1 INT C GEN ALG TH, V154, P154, DOI DOI 10.4324/9781315799674
[10] HOLLAND JH, 1975, ADAPTATION NATURAL A

← 1 2 →