Data Structures in Multi-Objective Evolutionary Algorithms

被引：8

作者：

Altwaijry, Najwa ^{[1
]}

Menai, Mohamed El Bachir ^{[1
]}

机构：

[1] King Saud Univ, Coll Comp & Informat Sci, Dept Comp Sci, Riyadh 11453, Saudi Arabia

来源：

JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY | 2012年 / 27卷 / 06期

关键词：

multi-objective evolutionary algorithm; data structure; Paseto front; archive; population; GENETIC ALGORITHM;

D O I：

10.1007/s11390-012-1296-y

中图分类号：

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

学科分类号：

0812 ;

摘要：

Data structures used for an algorithm can have a great impact on its performance, particularly for the solution of large and complex problems, such as multi-objective optimization problems (MOPs). Multi-objective evolutionary algorithms (MOEAs) are considered an attractive approach for solving MOPs, since they are able to explore several parts of the Pareto front simultaneously. The data structures for storing and updating populations and non-dominated solutions (archives) may affect the efficiency of the search process. This article describes data structures used in MOEAs for realizing populations and archives in a comparative way, emphasizing their computational requirements and general applicability reported in the original work.

引用

页码：1197 / 1210

页数：14

共 26 条

[11]

Finkel R. A., 1974, Acta Informatica, V4, P1, DOI 10.1007/BF00288933

[12]

HORN J, 1997, HDB EVOLUTIONARY COM

[13]

Laumanns M, 2001, LECT NOTES COMPUT SC, V1993, P181

[14]

Li MQ, 2008, IEEE C EVOL COMPUTAT, P617

[15]

Mostaghim S, 2002, IEEE C EVOL COMPUTAT, P843, DOI 10.1109/CEC.2002.1007035

[16]

Mostaghim S, 2004, ADV INFO KNOW PROC, P81

[17]

Mostaghim S, 2004, THESIS INFORM MATH U

[18]

Mostaghim S, 2001, 02 EL ENG LAB

[19]

Parks GT, 1998, LECT NOTES COMPUT SC, V1498, P250, DOI 10.1007/BFb0056868

[20]

SCHUTZE O, 2003, P 2 EMO APR, V2632, P509

← 1 2 3 →