A Fast Incremental Hypervolume Algorithm

被引：65

作者：

Bradstreet, Lucas ^{[1
]}

While, Lyndon ^{[1
]}

Barone, Luigi ^{[1
]}

机构：

[1] Univ Western Australia, Sch Comp Sci & Software Engn, Nedlands, WA 6009, Australia

来源：

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION | 2008年 / 12卷 / 06期

关键词：

Diversity; evolutionary computation; hypervolume; multiobjective optimization; performance metrics;

D O I：

10.1109/TEVC.2008.919001

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

When hypervolume is used as part of the selection or archiving process in a multiobjective evolutionary algorithm, it is necessary to determine which solutions contribute the least hypervolume to a front. Little focus has been placed on algorithms that quickly determine these solutions and there are no fast algorithms designed specifically for this purpose. We describe an algorithm, IHSO, that quickly determines a solution's contribution. Furthermore, we describe and analyse heuristics that reorder objectives to minimize the work required for IHSO to calculate a solution's contribution. Lastly, we describe and analyze search techniques that reduce the amount of work required for solutions other than the least contributing one. Combined, these techniques allow multiobjective evolutionary algorithms to calculate hypervolume inline in increasingly complex and large fronts in many objectives.

引用

页码：714 / 723

页数：10

共 22 条

[1]

[Anonymous], HYPERVOLUME METRIC C

[2]

Back T., 1997, Handbook of evolutionary computation

[3]

Beume N., 2006, 21606 CI U DORTM

[4] Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms [J].

Bradstreet, Lucas ;

While, Lyndon ;

Barone, Luigi .

2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, :3203-3210

[5]

Bradstreet L, 2006, IEEE C EVOL COMPUTAT, P1729

[6]

Deb K, 2002, IEEE C EVOL COMPUTAT, P825, DOI 10.1109/CEC.2002.1007032

[7]

Emmerich M, 2005, LECT NOTES COMPUT SC, V3410, P62

[8]

Fleischer M, 2003, LECT NOTES COMPUT SC, V2632, P519

[9]

FLEISCHER M, 2002, 200232 ISR TR U MARY

[10]

Fonseca CM, 2006, IEEE C EVOL COMPUTAT, P1142

← 1 2 3 →