Dynamic cluster in particle swarm optimization algorithm

DOI10.1007/S11047-014-9465-2MaRDI QIDQ2003492zbMATH OpenOpenAlexFDO

Authors Abbas El Dor, David Lemoine, Maurice Clerc, Patrick Siarry, Laurent Deroussi, Michel Gourgand

Publication date 8 July 2019

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-014-9465-2

zbMATH Keywords

social networksparticle swarm optimizationdynamic clusterglobal bestlocal bestneighborhood topologies

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Dynamic probabilistic particle swarm optimization based on varying multi-cluster structure
• Clan particle swarm optimization
• A dynamic inertia weight particle swarm optimization algorithm
• Dynamic adjusting modified particle swarm algorithm
• A particle swarm optimization based memetic algorithm for dynamic optimization problems

Cites work

• scientific article; zbMATH DE number 5519825 (Why is no real title available?)
• A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization
• Collective dynamics of `small-world' networks

Cited in

(6)

• Clan particle swarm optimization
• Dynamic probabilistic particle swarm optimization based on varying multi-cluster structure
• AI 2005: Advances in Artificial Intelligence
• Advances in Artificial Intelligence – SBIA 2004
• Particle swarm optimization with age-group topology for multimodal functions and data clustering
• Particle swarm optimization with dynamic random population topology strategies for a generalized portfolio selection problem

Describes a project that uses

Uses Software

• CEC 05

This page was built for publication: Dynamic cluster in particle swarm optimization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003492)