Absolute versus stochastic stability of the artificial bee colony in synchronous and sequential modes
From MaRDI portal
Publication:6095504
DOI10.1007/s11047-020-09808-0zbMath1530.68280OpenAlexW3095317777MaRDI QIDQ6095504
Publication date: 8 September 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-020-09808-0
convergence analysisabsolute stabilitystochastic stabilityswarm intelligenceartificial bee colonyparameter setting
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- A global best artificial bee colony algorithm for global optimization
- Gbest-guided artificial bee colony algorithm for numerical function optimization
- Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm
- Algebraic unsolvability of problem of absolute stability of desynchronized systems
- Artificial bee colony algorithm with multiple search strategies
- GSA: A gravitational search algorithm
- A comparative study of artificial bee colony algorithm
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- Hadamard products and multivariate statistical analysis
- Self-adaptive artificial bee colony