A collaborative decomposition-based evolutionary algorithm integrating normal and penalty-based boundary intersection for many-objective optimization

04/14/2022
by   Yu Wu, et al.
0

Decomposition-based evolutionary algorithms have become fairly popular for many-objective optimization in recent years. However, the existing decomposition methods still are quite sensitive to the various shapes of frontiers of many-objective optimization problems (MaOPs). On the one hand, the cone decomposition methods such as the penalty-based boundary intersection (PBI) are incapable of acquiring uniform frontiers for MaOPs with very convex frontiers. On the other hand, the parallel reference lines of the parallel decomposition methods including the normal boundary intersection (NBI) might result in poor diversity because of under-sampling near the boundaries for MaOPs with concave frontiers. In this paper, a collaborative decomposition method is first proposed to integrate the advantages of parallel decomposition and cone decomposition to overcome their respective disadvantages. This method inherits the NBI-style Tchebycheff function as a convergence measure to heighten the convergence and uniformity of distribution of the PBI method. Moreover, this method also adaptively tunes the extent of rotating an NBI reference line towards a PBI reference line for every subproblem to enhance the diversity of distribution of the NBI method. Furthermore, a collaborative decomposition-based evolutionary algorithm (CoDEA) is presented for many-objective optimization. A collaborative decomposition-based environmental selection mechanism is primarily designed in CoDEA to rank all the individuals associated with the same PBI reference line in the boundary layer and pick out the best ranks. CoDEA is compared with several popular algorithms on 85 benchmark test instances. The experimental results show that CoDEA achieves high competitiveness benefiting from the collaborative decomposition maintaining a good balance among the convergence, uniformity, and diversity of distribution.

READ FULL TEXT

page 3

page 19

research
07/13/2018

A Many-Objective Evolutionary Algorithm Based on Decomposition and Local Dominance

Many-objective evolutionary algorithms (MOEAs), especially the decomposi...
research
12/15/2020

A New Many-Objective Evolutionary Algorithm Based on Determinantal Point Processes

To handle different types of Many-Objective Optimization Problems (MaOPs...
research
01/25/2018

A mullti- or many- objective evolutionary algorithm with global loop update

Multi- or many-objective evolutionary algorithm- s(MOEAs), especially th...
research
06/27/2018

A Decomposition-Based Many-Objective Evolutionary Algorithm with Local Iterative Update

Existing studies have shown that the conventional multi-objective evolut...
research
09/30/2017

A Many-Objective Evolutionary Algorithm with Angle-Based Selection and Shift-Based Density Estimation

Evolutionary many-objective optimization has been gaining increasing att...
research
03/03/2018

An Interactive Many Objective Evolutionary Algorithm with Cascade Clustering and Reference Point Incremental Learning

Researches have shown difficulties in obtaining proximity while maintain...
research
04/12/2019

A Reference Vector based Many-Objective Evolutionary Algorithm with Feasibility-aware Adaptation

The infeasible parts of the objective space in difficult many-objective ...

Please sign up or login with your details

Forgot password? Click here to reset