A modified particle swarm optimization based on decomposition with different ideal points for many-objective optimization problems

Abstract

Many evolutionary algorithms have been proposed for multi-/many-objective optimization problems; however, the tradeoff of convergence and diversity is still the challenge for optimization algorithms. In this paper, we propose a modified particle swarm optimization based on decomposition framework with different ideal points on each reference vector, called MPSO/DD, for many-objective optimization problems. In the MPSO/DD algorithm, the decomposition strategy is used to ensure the diversity of the population, and the ideal point on each reference vector can draw the population converge faster to the optimal front. The position of each individual will be updated by learning the demonstrators in its neighborhood that have less distance to the ideal point along the reference vector. Eight state-of-the-art evolutionary multi-/many-objective optimization algorithms are adopted to compare the performance with MPSO/DD for solving many-objective optimization problems. The experimental results on seven DTLZ test problems with 3, 5, 8, 10, 15 and 20 objectives, respectively, show the efficiency of our proposed method on solving problems with high-dimensional objective space.

Optimal Design and Simulation for PID Controller Using Fractional-Order Fish Migration Optimization Algorithm

“…From (14), due to a = 2.25, b = 36.2, x = 2.23, it can be find that for the whole fraction, compared to numerator, denominator is much bigger. As the iterative process continues, the speed of the fish gradually slows down, which will cause the algorithm to stagnate.…”

“…Among them, swarm intelligence algorithms are inspired by the ethology of group animals. For example, Particle Swarm Optimization (PSO) [11]- [14] is inspired by birds' foraging behavior. Ant Colony Optimization (ACO) [15], [16] mimicked the behavior of ants in finding the path in the process of searching for food.…”

A Novel Binary QUasi-Affine TRansformation Evolutionary (QUATRE) Algorithm

“…It is easy to compute but is hard to converge; Gravitational Search Algorithm (GSA) [4][5][6] was proposed based on Newtonian gravity and the laws of motion, and it has strong exploitation ability but weak exploration ability; Sine Cosine Algorithm (SCA) [7][8][9] created multiple initial random candidate solutions and then used a mathematical model based on sine and cosine functions to make these solutions fluctuate in the direction of the optimal solution or in the opposite direction. In Swarm intelligence algorithms, Particle Swarm Optimization (PSO) [10][11][12][13] simulated the foraging behaviour of birds to obtain the optimal solution. In particular, it was the first swarm intelligence algorithm; Ant Colony Optimization (ACO) [14][15][16] was inspired by the foraging behavior of ant colony.…”

“…Consequently, many excellent algorithms were proposed to apply the meta-heuristic algorithms for solving practical problems. Furthermore, a new surrogate-assisted model on PSO to deal with the high dimensional problem is used [12]; S. Qin et al proposed a modified PSO based on a decomposition framework with different ideal points on each reference vector to solve many-objective optimization problems [13]; P.-C. Song et al developed a compact scheme on CSO to effectively save the memory of the unmanned robot [30]. There are some other practical problems that are binary optimization problems, such as feature extraction and 0-1 knapsack problems, but most meta-heuristic algorithms are designed for a continuous search space.…”

A comparative study of social group optimization with a few recent optimization algorithms

“…A new differential evolution algorithm (NSDE-R) capable of efficiently solving many-objective optimization problems, where the algorithms make use of reference points evenly distributed through the objective function space to preserve diversity and aid in multi-criteria-decision making was thus proposed [94]. Generally, the methods proposed for solving MaOPs can be roughly classified into three categories [95]. These are (1) multi/many-objective optimization algorithms based on dominance relationships.…”