Random drift particle swarm optimization algorithm: convergence analysis and parameter selection
From MaRDI portal
Publication:890323
DOI10.1007/S10994-015-5522-ZzbMATH Open1343.68224arXiv1306.2863OpenAlexW1896558367WikidataQ62787937 ScholiaQ62787937MaRDI QIDQ890323FDOQ890323
Authors: N. E. Zubov 
Publication date: 10 November 2015
Published in: Machine Learning (Search for Journal in Brave)
Abstract: The random drift particle swarm optimization (RDPSO) algorithm, inspired by the free electron model in metal conductors placed in an external electric field, is presented, systematically analyzed and empirically studied in this paper. The free electron model considers that electrons have both a thermal and a drift motion in a conductor that is placed in an external electric field. The motivation of the RDPSO algorithm is described first, and the velocity equation of the particle is designed by simulating the thermal motion as well as the drift motion of the electrons, both of which lead the electrons to a location with minimum potential energy in the external electric field. Then, a comprehensive analysis of the algorithm is made, in order to provide a deep insight into how the RDPSO algorithm works. It involves a theoretical analysis and the simulation of the stochastic dynamical behavior of a single particle in the RDPSO algorithm. The search behavior of the algorithm itself is also investigated in detail, by analyzing the interaction between the particles. Some variants of the RDPSO algorithm are proposed by incorporating different random velocity components with different neighborhood topologies. Finally, empirical studies on the RDPSO algorithm are performed by using a set of benchmark functions from the CEC2005 benchmark suite. Based on the theoretical analysis of the particle's behavior, two methods of controlling the algorithmic parameters are employed, followed by an experimental analysis on how to select the parameter values, in order to obtain a good overall performance of the RDPSO algorithm and its variants in real-world applications. A further performance comparison between the RDPSO algorithms and other variants of PSO is made to prove the efficiency of the RDPSO algorithms.
Full work available at URL: https://arxiv.org/abs/1306.2863
Recommendations
- The particle swarm optimization algorithm: Convergence analysis and parameter selection
- Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm
- Particle swarm optimization using dimension selection methods
- Parameter selection and experimental analysis of the random numbers in particle swarm optimization algorithms
- scientific article; zbMATH DE number 6907050
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Title not available (Why is that?)
- A study of particle swarm optimization particle trajectories
- Title not available (Why is that?)
- The particle swarm optimization algorithm: Convergence analysis and parameter selection
- Convergence rates of efficient global optimization algorithms
- A Convergence Proof for the Particle Swarm Optimiser
- Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm
- Minimization by Random Search Techniques
- Parameter estimation for chaotic systems with a Drift Particle Swarm Optimization method
- Title not available (Why is that?)
- Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns
- Quasi-Newton method: a new direction
- Adaptive bare-bones particle swarm optimization algorithm and its convergence analysis
Cited In (11)
- Multi-objective optimization algorithm based on improved particle swarm in cloud computing environment
- Insights into the molecular mechanisms of protein-ligand interactions by molecular docking and molecular dynamics simulation: a case of oligopeptide binding protein
- A new PSO algorithm with random C/D switchings
- Parameter selection and experimental analysis of the random numbers in particle swarm optimization algorithms
- Analysis and parameter adjustment of the RDPSO towards an understanding of robotic network dynamic partitioning based on Darwin's theory
- Affine invariance of \textit{meta}-heuristic algorithms
- Multi-objective cellular particle swarm optimization and RBF for drilling parameters optimization
- Particle swarm optimization using dimension selection methods
- Considerations for parameter configuration on vortex particle swarm optimization
- Random drift particle swarm optimisation algorithm for highly flexible protein-ligand docking
- Title not available (Why is that?)
Uses Software
This page was built for publication: Random drift particle swarm optimization algorithm: convergence analysis and parameter selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890323)
