Balancing convergence and diversity in resource allocation strategy for decomposition-based multi-objective evolutionary algorithm

doi:10.1016/j.asoc.2020.106968

2021-03-01

PRE

DOI：10.1016/j.asoc.2020.106968

原文链接

原文求助

摘要

En 中文

Decomposition-based multi-objective evolutionary algorithm decomposes a multi-objective optimization problem into a set of scalar subproblems and then optimizes them simultaneously. However, it does not take into account that subproblems of different difficulties need unequal computing resources. The resource allocation (RA) strategy based on MOEA/D was proposed to solve this problem. But most RA strategies generate a large number of solutions around some easy optimization subproblems, which cause the deterioration of the distribution. And the way they measure the subproblem difficulty ignores that subproblems may lose their evolvability in an evolutionary period. This paper aims to balance the convergence and diversity in RA strategy. Firstly, we introduce the accumulated escape probability (AEP) to calculate the historical improvement probability of each subproblem and then measure the subproblem evolvability, which can detect whether the subproblem has lost its evolvability in an evolutionary period. Secondly, we propose a density penalty-based individual screening mechanism (ISM) to enhance diversity. It gives priority to update the subproblem surrounded with more solutions and greater relative improvement on aggregated function. Finally, the above two methods are cooperated in MOEA/D and named it MOEA/D-BRA. Then the effectiveness of these two methods and the comprehensive performance of MOEA/D-BRA are tested. Furthermore, the BRA strategy is applied to more cases to balance convergence and diversity. Several experimental results indicate that the BRA strategy performers well on tackling a set of complicated optimization problems. (c) 2020 Elsevier B.V. All rights reserved.

Keyword:

Accumulated escape probability

Subproblem evolvability

Dynamic resource allocation

Multi-objective evolutionary

AI总结

对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Soft Computing

IF:

6.6

论文数:

1.4W

被引数:

4.8W

机构

zhejiang university of technology

学者数:

3.3W

论文数: 2.0W

被引数: 22

引用论文

IF0

OAAI

PATH-24. MOLECULAR CLASSIFICATION OF HIGH RISK INFANT EMBRYONAL BRAIN TUMORS ENROLLED IN THE ACNS0334 TRIAL: A REPORT FROM THE CHILDREN’S ONCOLOGY GROUP

Neuro-Oncology

IF0

2020-12-04

OAAI

Bryan K Li; Peter Burger; Alexander R Judkins; Ben L B Ho; Guolian Kang; Jeffrey Gossett; Sarah Leary; Ian Pollack; Amar Gajjar; Maryam Fouladi; Stewart J Kellie; Claire Mazewski; Annie Huang

Bacterial Rhodopsin: Evidence for a New Type of Phototrophy in the Sea

Science

IF0

2000-09-15

PREAI

Oded Béjà; L. Aravind; Eugene V. Koonin; Marcelino T. Suzuki; Andrew Hadd; Linh P. Nguyen; Stevan B. Jovanovich; Christian M. Gates; Robert A. Feldman; John L. Spudich; Elena N. Spudich; Edward F. DeLong

An efficient multi-objective model and algorithm for sizing a stand-alone hybrid renewable energy system 一种高效的多目标模型和算法，用于确定独立的混合可再生能源系统

ENERGY

IF9.4

2017-12-01

PREAI

Wang, Rui; Li, Guozheng; Ming, Mengjun; Wu, Guohua; Wang, Ling

An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts 一种改进的基于复杂帕累托前沿分解的多目标优化进化算法

IEEE TRANSACTIONS ON CYBERNETICS

IF10.5

2016-02-01

192