Research Repository

Decomposition-based algorithms using pareto adaptive scalarizing methods

Wang, R and Zhang, Q and Zhang, T (2016) 'Decomposition-based algorithms using pareto adaptive scalarizing methods.' IEEE Transactions on Evolutionary Computation, 20 (6). 821 - 837. ISSN 1089-778X

Full text not available from this repository.

Abstract

© 1997-2012 IEEE. Decomposition-based algorithms have become increasingly popular for evolutionary multiobjective optimization. However, the effect of scalarizing methods used in these algorithms is still far from being well understood. This paper analyzes a family of frequently used scalarizing methods, the Lp methods, and shows that the p value is crucial to balance the selective pressure toward the Pareto optimal and the algorithm robustness to Pareto optimal front (PF) geometries. It demonstrates that an Lp method that can maximize the search ability of a decomposition-based algorithm exists and guarantees that, given some weight, any solution along the PF can be found. Moreover, a simple yet effective method called Pareto adaptive scalarizing (PaS) approximation is proposed to approximate the optimal p value. In order to demonstrate the effectiveness of PaS, we incorporate PaS into a state-of-the-art decomposition-based algorithm, i.e., multiobjective evolutionary algorithm based on decomposition (MOEA/D), and compare the resultant MOEA/D-PaS with some other MOEA/D variants on a set of problems with different PF geometries and up to seven conflicting objectives. Experimental results demonstrate that the PaS is effective.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Jim Jamieson
Date Deposited: 14 Dec 2016 09:46
Last Modified: 30 Jan 2019 16:20
URI: http://repository.essex.ac.uk/id/eprint/18554

Actions (login required)

View Item View Item