Vector-angle penalised NSGA-III to solve many-objective optimisation problems

Vector-angle penalised NSGA-III to solve many-objective optimisation problems

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

One of the major challenges in evolutionary many-objective optimisation is to maintain convergence and diversity among Pareto-optimal solutions. Taking both into consideration, this Letter presents a -NSGA-III algorithm which incorporates minimum-vector-angle principle in association operation of original non-dominated sorting genetic algorithm III (NSGA-III) scheme to solve unconstrained many-objective optimisation problems. Each non-dominated population member close to a reference point is emphasised in optimal solution set using minimum vector-angle penalty parameter with perpendicular distance in association operation. Performance evaluation of -NSGA-III algorithm is done over unconstrained DTLZ test suite by computing delta () and inverted generational distance as quality metrics. The improved performance of the suggested algorithm over NSGA-III, MOEA/D and VaEA could be considered as an alternative tool to handle optimisation problems with more than three conflicting objectives.

Related content

This is a required field
Please enter a valid email address