Decomposition-Based Multiobjective Optimization Algorithms With Adaptively Adjusting Weight Vectors and Neighborhoods

The decomposition-based multiobjective optimization algorithm (MOEA/D) is an effective method of solving a multiobjective optimization problem (MOP). The main idea of MOEA/D is that the objectives are weighted through different vectors to form different subproblems, and an optimal solution set is ob...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on evolutionary computation Ročník 27; číslo 5; s. 1485 - 1497
Hlavní autoři: Zhao, Qian, Guo, Yinan, Yao, Xiangjuan, Gong, Dunwei
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Adaptive mechanism
Algorithms
Convergence
Decomposition
decomposition-based multiobjective optimization algorithm (MOEA/D)
Evolutionary algorithms
Linear programming
Multiple objective analysis
neighborhood adjustment
Neighborhoods
Optimization
Pareto optimization
Population density
Runtime
Search problems
Sociology
Statistics
Vectors (mathematics)
weight vector
ISSN:1089-778X, 1941-0026
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The decomposition-based multiobjective optimization algorithm (MOEA/D) is an effective method of solving a multiobjective optimization problem (MOP). The main idea of MOEA/D is that the objectives are weighted through different vectors to form different subproblems, and an optimal solution set is obtained by co-evolution in a certain neighborhood. However, with the increase of objectives, the number of nondominated solutions increases exponentially, resulting in the deteriorated capability of searching for optimal solutions. In addition, for an optimization problem with the complex Pareto front (PF), the selection pressure of nondominated solutions is insufficient. To make evolution more efficient, an MOEA/D with adaptively adjusting weight vectors and neighborhoods (MOEA/D-AAWNs) is developed in this article. First, the evolutionary direction of each subproblem is analyzed and the Sparsity function (Spa) is proposed to measure the population density on the PF. By using Spa, a method of generating uniform vectors is presented to improve the diversity of solutions. Besides, a method of adaptively adjusting neighborhoods is given. It adjusts neighborhoods according to the number of iterations and the Spa value of its corresponding subproblem. In this way, the computational resource can be effectively allocated, leading to the improvement in evolutionary efficiency. The proposed algorithm is applied to solve a series of benchmark optimization instances, and the experimental results show that the proposed algorithm outperforms comparison algorithms in runtime, convergence, and diversity.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-778X
1941-0026
DOI:10.1109/TEVC.2022.3201890