Comparison of certain evolutionary algorithms

被引：4

作者：

Borisovskii, PA ^{[1
]}

Eremeev, AV ^{[1
]}

机构：

[1] Russian Acad Sci, Siberian Branch, Omsk Affiliated Inst Math, Omsk, Russia

来源：

AUTOMATION AND REMOTE CONTROL | 2004年 / 65卷 / 03期

关键词：

Mechanical Engineer; System Theory; Evolutionary Algorithm; Monotonicity Condition; Simple Evolutionary Algorithm;

D O I：

10.1023/B:AURC.0000019365.10288.58

中图分类号：

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

学科分类号：

0812 ;

摘要：

A simple evolutionary algorithm is theoretically compared with other methods of this class for a situation in which the operator of transition to new solutions satisfies the so-called monotonicity condition. This algorithm under the monotonicity condition is optimal in the class of evolutionary algorithms.

引用

页码：357 / 362

页数：6

共 18 条

[1]

ALDOUS D, 1994, AN S FDN CO, P492, DOI 10.1109/SFCS.1994.365742

[2]

[Anonymous], 1989, GENETIC ALGORITHM SE

[3]

[Anonymous], ORIGIN SPECIES

[4] A SHARP BOUND ON THE RATIO BETWEEN OPTIMAL INTEGER AND FRACTIONAL COVERS [J].

BALAS, E .

MATHEMATICS OF OPERATIONS RESEARCH, 1984, 9 (01) :1-5

[5]

Beyer H.-G., 2001, NAT COMP SER

[6]

Borisovsky PA, 2003, LECT NOTES COMPUT SC, V2611, P154

[7]

BORISOVSKY PA, 2003, FDN GENETIC ALGORITH, V7

[8]

Eremeev AV, 2000, LECT NOTES COMPUT SC, V1829, P84

[9]

ERMEEV AV, 2000, DISKRET ANALIZ ISSL, V7, P47

[10] OPTIMIZATION BY SIMULATED ANNEALING - AN EXPERIMENTAL EVALUATION .1. GRAPH PARTITIONING [J].

JOHNSON, DS ;

ARAGON, CR ;

MCGEOCH, LA ;

SCHEVON, C .

OPERATIONS RESEARCH, 1989, 37 (06) :865-892

← 1 2 →