Efficient Large-Scale Multiobjective Optimization Based on a Competitive Swarm Optimizer

Ye Tian

doi:10.1109/TCYB.2019.2906383

Return

Efficient Large-Scale Multiobjective Optimization Based on a Competitive Swarm Optimizer

2020-08-01

257

DOI：10.1109/TCYB.2019.2906383

Original

Save

View PDF

Abstract

En 中文

There exist many multiobjective optimization problems (MOPs) containing a large number of decision variables in real-world applications, which are known as large-scale MOPs. Due to the ineffectiveness of existing operators in finding optimal solutions in a huge decision space, some decision variable division-based algorithms have been tailored for improving the search efficiency in solving large-scale MOPs. However, these algorithms will encounter difficulties when solving problems with complicated landscapes, as the decision variable division is likely to be inaccurate and time consuming. In this paper, we propose a competitive swarm optimizer (CSO)-based efficient search for solving large-scale MOPs. The proposed algorithm adopts a new particle updating strategy that suggests a two-stage strategy to update position, which can highly improve the search efficiency. The experimental results on large-scale benchmark MOPs and an application example demonstrate the superiority of the proposed algorithm over several state-of-the-art multiobjective evolutionary algorithms, including problem transformation-based algorithm, decision variable clustering-based algorithm, particle swarm optimization algorithm, and estimation of distribution algorithm.

Keywords:

Optimization

Clustering algorithms

Particle swarm optimization

Computer science

Sociology

Statistics

Trajectory

Competitive swarm optimizer (CSO)

evolutionary multiobjective optimization

large-scale multiobjective optimization problem

particle swarm optimization (PSO)

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.