2019•Journal of Physics Conference SeriesOpen access

Improvement of Differential Evolution Multiobjective Optimization Algorithm Based on Decomposition

Jiaxin Han, Manman He, Xiaoxiao Wang

Open full text 3 citations

Abstract

Multi-objective optimization problem (MOP) is a challenging field of scientific research in real-life. The effective way to solve multi-objective optimization problems is Multi-objective Evolutionary Algorithm (MOEA). In this paper, enhancements to a Multi-objective Evolutionary algorithm MOEA/D-DE are proposed. The proposed improvement points help to improve both population distribution and algorithmic local search capabilities. In an existing study, in order to better distribute the population, the Monte Carlo method was used for population initialization. Adaptive differential evolution operators are used to improve the local search ability of the algorithm. The algorithm was tested on widely used ZDT and DTLZ family test problems. The experimental results show that the proposed algorithm is better than MOEA/D-DE and has better performance than other excellent multi-objective algorithms.

Open-access reader

About this research paper

What this paper is about

Multi-objective optimization problem (MOP) is a challenging field of scientific research in real-life. The effective way to solve multi-objective optimization problems is Multi-objective Evolutionary Algorithm (MOEA). In this paper, enhancements to a Multi-objective Evolutionary algorithm MOEA/D-DE are proposed. The proposed improvement points help to improve both population distribution and algorithmic local search capabilities. In an existing study, in order to better distribute the population, the Monte Carlo method was used for population initialization. Adaptive differential evolution operators are used to improve the local search ability of the algorithm. The algorithm was tested on widely used ZDT and DTLZ family test problems. The experimental results show that the proposed algorithm is better than MOEA/D-DE and has better performance than other excellent multi-objective algorithms.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Multi-objective optimization problem (MOP) is a challenging field of scientific research in real-life. The effective way to solve multi-objective optimization problems is Multi-objective Evolutionary Algorithm (MOEA). In this paper, enhancements to a Multi-objective Evolutionary algorithm MOEA/D-DE are proposed. The proposed improvement points help to improve both population distribution and algorithmic local search capabilities. In an existing study, in order to better distribute the population, the Monte Carlo method was used for population initialization. Adaptive differential evolution operators are used to improve the local search ability of the algorithm. The algorithm was tested on widely used ZDT and DTLZ family test problems. The experimental results show that the proposed algorithm is better than MOEA/D-DE and has better performance than other excellent multi-objective algorithms.

Key concepts: Evolutionary algorithm, Initialization, Mathematical optimization, Differential evolution, Population, Computer science, Multi-objective optimization, Decomposition

Related papers

Back to paper searchBrowse research topicsOriginal source
Improvement of Differential Evolution Multiobjective Optimization Algorithm Based on Decomposition — Research Paper | ScholarLens