A quasi-randomized initialized simulated annealing particle swarm optimization algorithm

DOI10.13705/J.ISSN.1671-6841.2016022MaRDI QIDQ2987339zbMATH OpenFDO

Authors Jie Wang, Huihui Li, Jinzhu Peng

Publication date 17 May 2017

Full work available at URL https://doi.org/10.13705/J.ISSN.1671-6841.2016022

zbMATH Keywords

initializationparticle swarm optimizationquasi-random sequencesimulated annealing

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

• Global particle swarm optimization for high dimension numerical functions analysis
• Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification
• Optimizing high-dimensional functions with an efficient particle swarm optimization algorithm
• Improvement of quantum-behaved particle swarm optimization algorithm for high-dimensional and multi-modal functions
• Particle swarm optimization with chaotic opposition-based population initialization and stochastic search technique

Cited in

(6)

• A novel hybrid SP-QPSO algorithm using CVT for high dimensional problems
• Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification
• scientific article; zbMATH DE number 7366146 (Why is no real title available?)
• Improvement of quantum-behaved particle swarm optimization algorithm for high-dimensional and multi-modal functions
• Accelerated high-dimensional global optimization: a particle swarm optimizer incorporating homogeneous learning and autophagy mechanisms
• Optimizing high-dimensional functions with an efficient particle swarm optimization algorithm

This page was built for publication: A quasi-randomized initialized simulated annealing particle swarm optimization algorithm

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