The block diagram method for designing the particle swarm optimization algorithm

DOI10.1007/S10898-011-9699-9zbMath1245.90148OpenAlexW2168028910MaRDI QIDQ427406

Lu Baiquan, Lu Zeyu, Gao Gaiqin

Publication date: 13 June 2012

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-011-9699-9

zbMATH Keywords

global optimizationlocal optimizationparticle swarmblock diagram method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• On the utility of randomly generated functions for performance evaluation of evolutionary algorithms
• A hybrid simplex search and particle swarm optimization for unconstrained optimization
• A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
• Global optimization using a synchronization of multiple search points autonomously driven by a chaotic dynamic model
• A comparison of several nearest neighbor classifier metrics using tabu search algorithm for the feature selection problem
• A review of particle swarm optimization. I: Background and development
• Memetic particle swarm optimization

This page was built for publication: The block diagram method for designing the particle swarm optimization algorithm