Scale-free fully informed particle swarm optimization algorithm
From MaRDI portal
Publication:433098
DOI10.1016/J.INS.2011.02.026zbMath1242.68298OpenAlexW1982988055MaRDI QIDQ433098
Publication date: 13 July 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2011.02.026
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
Population interaction network in representative differential evolution algorithms: power-law outperforms Poisson distribution ⋮ A modified artificial bee colony algorithm based on search space division and disruptive selection strategy ⋮ Enhancing artificial bee colony algorithm using more information-based search equations
Cites Work
- The structure and function of networks
- Multi-strategy ensemble particle swarm optimization for dynamic optimization
- The particle swarm optimization algorithm: Convergence analysis and parameter selection
- Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
This page was built for publication: Scale-free fully informed particle swarm optimization algorithm