Shrinking hypersphere based trajectory of particles in PSO
From MaRDI portal
Publication:902500
DOI10.1016/J.AMC.2013.05.065zbMath1329.90178OpenAlexW2088646875MaRDI QIDQ902500
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
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Biogeography-based optimization for optimal job scheduling in cloud computing ⋮ Convergence of Gravitational Search Algorithm on Linear and Quadratic Functions
Uses Software
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
This page was built for publication: Shrinking hypersphere based trajectory of particles in PSO
