Random drift particle swarm optimization algorithm: convergence analysis and parameter selection
From MaRDI portal
Publication:890323
DOI10.1007/s10994-015-5522-zzbMath1343.68224arXiv1306.2863OpenAlexW1896558367WikidataQ62787937 ScholiaQ62787937MaRDI QIDQ890323
Publication date: 10 November 2015
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.2863
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
Affine invariance of \textit{meta}-heuristic algorithms ⋮ Random drift particle swarm optimisation algorithm for highly flexible protein-ligand docking ⋮ Insights into the molecular mechanisms of protein-ligand interactions by molecular docking and molecular dynamics simulation: a case of oligopeptide binding protein ⋮ Multi-objective optimization algorithm based on improved particle swarm in cloud computing environment
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameter estimation for chaotic systems with a Drift Particle Swarm Optimization method
- Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns
- Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm
- Adaptive bare-bones particle swarm optimization algorithm and its convergence analysis
- The particle swarm optimization algorithm: Convergence analysis and parameter selection
- A study of particle swarm optimization particle trajectories
- A Convergence Proof for the Particle Swarm Optimiser
- Minimization by Random Search Techniques
- Convergence rates of efficient global optimization algorithms
This page was built for publication: Random drift particle swarm optimization algorithm: convergence analysis and parameter selection
