Shrinking hypersphere based trajectory of particles in PSO

DOI10.1016/j.amc.2013.05.065zbMath1329.90178MaRDI QIDQ902500

Kusum Deep, Anupam Yadav

Publication date: 18 January 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.05.065

zbMATH Keywords

hypersphere; particle swarm optimization; function optimization

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Convergence of Gravitational Search Algorithm on Linear and Quadratic Functions, Biogeography-based optimization for optimal job scheduling in cloud computing

Uses Software

• PSOt

Cites Work

• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• Cellular particle swarm optimization
• A discrete version of particle swarm optimization for flowshop scheduling problems
• A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization
• The particle swarm optimization algorithm: Convergence analysis and parameter selection
• A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
• Particle swarm and ant colony algorithms hybridized for improved continuous optimization
• Particle swarm optimization-based algorithms for TSP and generalized TSP
• A dynamic inertia weight particle swarm optimization algorithm
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• Improved particle swarm algorithms for global optimization
• A study of particle swarm optimization particle trajectories
• Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization
• From Theory to Practice in Particle Swarm Optimization