University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Two Arch2: An Improved Two-Archive Algorithm for Many-Objective Optimization

Wang, H, Jiao, L and Yao, X (2015) Two Arch2: An Improved Two-Archive Algorithm for Many-Objective Optimization IEEE Transactions on Evolutionary Computation, 19 (4). pp. 524-541.

Full text not available from this repository.


© 1997-2012 IEEE.Many-objective optimization problems (ManyOPs) refer, usually, to those multiobjective problems (MOPs) with more than three objectives. Their large numbers of objectives pose challenges to multiobjective evolutionary algorithms (MOEAs) in terms of convergence, diversity, and complexity. Most existing MOEAs can only perform well in one of those three aspects. In view of this, we aim to design a more balanced MOEA on ManyOPs in all three aspects at the same time. Among the existing MOEAs, the two-archive algorithm (Two-Arch) is a low-complexity algorithm with two archives focusing on convergence and diversity separately. Inspired by the idea of Two-Arch, we propose a significantly improved two-archive algorithm (i.e., Two-Arch2) for ManyOPs in this paper. In our Two-Arch2, we assign different selection principles (indicator-based and Pareto-based) to the two archives. In addition, we design a new Lp-norm-based ( p<1) diversity maintenance scheme for ManyOPs in Two-Arch2. In order to evaluate the performance of Two-Arch2 on ManyOPs, we have compared it with several MOEAs on a wide range of benchmark problems with different numbers of objectives. The experimental results show that Two Arch2 can cope with ManyOPs (up to 20 objectives) with satisfactory convergence, diversity, and complexity.

Item Type: Article
Divisions : Surrey research (other units)
Authors :
Jiao, L
Yao, X
Date : 1 August 2015
DOI : 10.1109/TEVC.2014.2350987
Depositing User : Symplectic Elements
Date Deposited : 17 May 2017 13:42
Last Modified : 25 Jan 2020 00:17

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800