Order statistics and selection methods of evolutionary algorithms

被引：19

作者：

Cantú-Paz, E ^{[1
]}

机构：

[1] Lawrence Livermore Natl Lab, Ctr Appl Sci Comp, Livermore, CA 94551 USA

来源：

INFORMATION PROCESSING LETTERS | 2002年 / 82卷 / 01期

关键词：

analysis of algorithms; linear ranking; exponential ranking; tournament selection; Boltzmann selection; truncation selection; selection intensity; fitness distribution; order statistics;

D O I：

10.1016/S0020-0190(01)00282-4

中图分类号：

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

学科分类号：

0812 ;

摘要：

Selection methods are essential components of evolutionary algorithms (EAs). This paper reviews five popular selection methods used in EAs. The algorithms are examined using the cumulants of the fitness distribution of the selected individuals. The cumulants are calculated using order statistics. The method presented here considers finite populations of arbitrary size. The results show important differences among the selection methods considered. even when they are configured to have the same selection intensity. Published by Elsevier Science B.V.

引用

页码：15 / 22

页数：8

共 20 条

[11]

Holland J. H., 1973, SIAM Journal on Computing, V2, P88, DOI 10.1137/0202009

[12]

Miller B. L., 1995, Complex Systems, V9, P193

[13] Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization [J].

Muehlenbein, Heinz ;

Schlierkamp-Voosen, Dirk .

EVOLUTIONARY COMPUTATION, 1993, 1 (01) :25-49

[14] ANALYSIS OF GENETIC ALGORITHMS USING STATISTICAL-MECHANICS [J].

PRUGELBENNETT, A ;

SHAPIRO, JL .

PHYSICAL REVIEW LETTERS, 1994, 72 (09) :1305-1309

[15]

Rattray M., 1997, Foundations of Genetic Algorithms, V4, P117

[16]

Rogers A, 1999, FOUNDATIONS OF GENETIC ALGORITHMS, 5, P57

[17]

Schwefel H.P., 1981, NUMERICAL OPTIMIZATI

[18]

Shapiro J., 1994, Evolutionary Computing. AISB Workshop. Selected Papers, P17

[19]

Thierens D., 1997, P 7 INT C GEN ALG SA, P152

[20]

Voss MS, 1999, GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, P678

← 1 2 →