University of Surrey

Test tubes in the lab Research in the ATI Dance Research

A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization

Cheng, R, Jin, Y, Olhofer, M and Sendhoff, B (2016) A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization IEEE Transactions on Evolutionary Computation.

[img]
Preview
Text
RVEA_Merged.pdf - Accepted version Manuscript
Available under License : See the attached licence file.

Download (7MB) | Preview
[img]
Preview
PDF (licence)
SRI_deposit_agreement.pdf
Available under License : See the attached licence file.

Download (33kB) | Preview

Abstract

In evolutionary multi-objective optimization, maintaining a good balance between convergence and diversity is particularly crucial to the performance of the evolutionary algorithms. In addition, it becomes increasingly important to incorporate user preferences because it will be less likely to achieve a representative subset of the Pareto optimal solutions using a limited population size as the number of objectives increases. This paper proposes a reference vector guided evolutionary algorithm for many-objective optimization. The reference vectors can not only be used to decompose the original multiobjective optimization problem into a number of single-objective sub-problems, but also to elucidate user preferences to target a preferred subset of the whole Pareto front. In the proposed algorithm, a scalarization approach, termed angle penalized distance, is adopted to balance convergence and diversity of the solutions in the high-dimensional objective space. An adaptation strategy is proposed to dynamically adjust the distribution of the reference vectors according to the scales of the objective functions. Our experimental results on a variety of benchmark test problems show that the proposed algorithm is highly competitive in comparison with five state-of-the-art evolutionary algorithms for many-objective optimization. In addition, we show that reference vectors are effective and cost-efficient for preference articulation, which is particularly desirable for many-objective optimization. Furthermore, a reference vector regeneration strategy is proposed for handling irregular Pareto fronts. Finally, the proposed algorithm is extended for solving constrained many-objective optimization problems.

Item Type: Article
Subjects : Computer Science
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
AuthorsEmailORCID
Cheng, RUNSPECIFIEDUNSPECIFIED
Jin, YUNSPECIFIEDUNSPECIFIED
Olhofer, MUNSPECIFIEDUNSPECIFIED
Sendhoff, BUNSPECIFIEDUNSPECIFIED
Date : 2016
Identification Number : 10.1109/TEVC.2016.2519378
Additional Information : (c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Depositing User : Symplectic Elements
Date Deposited : 16 Mar 2016 11:13
Last Modified : 16 Mar 2016 11:13
URI: http://epubs.surrey.ac.uk/id/eprint/810220

Actions (login required)

View Item View Item

Downloads

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