Global particle swarm optimization for high dimension numerical functions analysis
Summary: The Particle Swarm Optimization (PSO) Algorithm is a popular optimization method that is widely used in various applications, due to its simplicity and capability in obtaining optimal results. However, ordinary PSOs may be trapped in the local optimal point, especially in high dimensional problems. To overcome this problem, an efficient Global Particle Swarm Optimization (GPSO) algorithm is proposed in this paper, based on a new updated strategy of the particle position. This is done through sharing information of particle position between the dimensions (variables) at any iteration. The strategy can enhance the exploration capability of the GPSO algorithm to determine the optimum global solution and avoid traps at the local optimum. The proposed GPSO algorithm is validated on a 12-benchmark mathematical function and compared with three different types of PSO techniques. The performance of this algorithm is measured based on the solutions' quality, convergence characteristics, and their robustness after 50 trials. The simulation results showed that the new updated strategy in GPSO assists in realizing a better optimum solution with the smallest standard deviation value compared to other techniques. It can be concluded that the proposed GPSO method is a superior technique for solving high dimensional numerical function optimization problems.
- Optimizing high-dimensional functions with an efficient particle swarm optimization algorithm
- Particle swarm optimization with FUSS and RWS for high dimensional functions
- High Dimension Complex Functions Optimization Using Adaptive Particle Swarm Optimizer
- Improving particle swarm optimization performance with local search for high-dimensional function optimization
- An Improved Particle Swarm Optimization Algorithm for Global Numerical Optimization
- A novel global optimization technique for high dimensional functions
- Parallel global optimization with the particle swarm algorithm
- GEPSO: a new generalized particle swarm optimization algorithm
- A quasi-randomized initialized simulated annealing particle swarm optimization algorithm
- Improving particle swarm optimization performance with local search for high-dimensional function optimization
- A modified PSO algorithm with dynamic parameters for solving complex engineering design problem
- Particle swarm optimization for problems with variable number of dimensions
- Improvement of quantum-behaved particle swarm optimization algorithm for high-dimensional and multi-modal functions
- Generalized particle swarm optimization algorithm - theoretical and empirical analysis with application in fault detection
- High Dimension Complex Functions Optimization Using Adaptive Particle Swarm Optimizer
- Accelerated high-dimensional global optimization: a particle swarm optimizer incorporating homogeneous learning and autophagy mechanisms
- Optimizing high-dimensional functions with an efficient particle swarm optimization algorithm
- Micro-particle swarm optimizer for solving high dimensional optimization problems ( PSO for high dimensional optimization problems)
This page was built for publication: Global particle swarm optimization for high dimension numerical functions analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1714562)
