Dynamic guiding particle swarm optimization with embedded chaotic search for solving multidimensional problems

DOI10.1007/S11590-011-0297-ZzbMATH Open1258.90107OpenAlexW2040253891MaRDI QIDQ691490FDOQ691490

Authors: Min-Yuan Cheng, Kuo-Yu Huang, Hung-Ming Chen 

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0297-z

Recommendations

• K-means particle swarm optimization with embedded chaotic search for solving multidimensional problems
• Chaotic hybrid particle swarm optimization algorithm based on tent map
• A novel particle swarm optimization algorithm based on dynamic P chaos and differential evolution
• Improved particle swarm optimization combined with chaos
• An improved particle swarm optimization algorithm combined with piecewise linear chaotic map

zbMATH Keywords

particle swarm optimizationchaotic searchdynamic guiding approach

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Simple mathematical models with very complicated dynamics
• Handbook of applied optimization
• Chaos embedded particle swarm optimization algorithms
• A study of global optimization using particle swarms
• The GLOBAL optimization method revisited
• Complexities and their applications to characterization of chaos
• Dynamic analysis for the selection of parameters and initial population, in particle swarm optimization

Cited In (2)

• A differential evolution algorithm with cooperative coevolutionary selection operation for high-dimensional optimization
• K-means particle swarm optimization with embedded chaotic search for solving multidimensional problems

This page was built for publication: Dynamic guiding particle swarm optimization with embedded chaotic search for solving multidimensional problems

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