4.6 Article

An Adaptive Localized Decision Variable Analysis Approach to Large-Scale Multiobjective and Many-Objective Optimization

Journal

IEEE TRANSACTIONS ON CYBERNETICS
Volume 52, Issue 7, Pages 6684-6696

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2020.3041212

Keywords

Optimization; Convergence; Pareto optimization; Search problems; Linear programming; Aerospace electronics; Perturbation methods; Decomposition; large-scale optimization; many-objective optimization; multiobjective optimization

Funding

  1. National Natural Science Foundation of China [61773103, 61872073, 71620107003, 61673331]
  2. Liaoning Revitalization Talents Program [XLYC1902010, XLYC1802115]
  3. Fundamental Research Funds for State Key Laboratory of Synthetical Automation for Process Industries [2013ZCX11]

Ask authors/readers for more resources

This article proposes an adaptive localized decision variable analysis approach under the decomposition-based framework to solve large-scale multiobjective and many-objective optimization problems. The algorithm incorporates the guidance of reference vectors into control variable analysis and optimizes decision variables using an adaptive strategy. Experimental results validate the effectiveness and efficiency of the proposed algorithm on the large-scale multiobjective and MaOPs.
This article proposes an adaptive localized decision variable analysis approach under the decomposition-based framework to solve the large-scale multiobjective and many-objective optimization problems (MaOPs). Its main idea is to incorporate the guidance of reference vectors into the control variable analysis and optimize the decision variables using an adaptive strategy. Especially, in the control variable analysis, for each search direction, the convergence relevance degree of each decision variable is measured by a projection-based detection method. In the decision variable optimization, the grouped decision variables are optimized with an adaptive scalarization strategy, which is able to adaptively balance the convergence and diversity of the solutions in the objective space. The proposed algorithm is evaluated with a suite of test problems with 2-10 objectives and 200-1000 variables. Experimental results validate the effectiveness and efficiency of the proposed algorithm on the large-scale multiobjective and MaOPs.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available