A Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm
نویسندگان
چکیده
منابع مشابه
A Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm
Particle swarm optimization (PSO) is an evolutionary computing method based on intelligent collective behavior of some animals. It is easy to implement and there are few parameters to adjust. The performance of PSO algorithm depends greatly on the appropriate parameter selection strategies for fine tuning its parameters. Inertia weight (IW) is one of PSO's parameters used to bring about a balan...
متن کاملInertia Weight Adaption in Particle Swarm Optimization Algorithm
In Particle Swarm Optimization (PSO), setting the inertia weight w is one of the most important topics. The inertia weight was introduced into PSO to balance between its global and local search abilities. In this paper, first, we propose a method to adaptively adjust the inertia weight based on particle’s velocity information. Second, we utilize both position and velocity information to adaptiv...
متن کاملChaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks
Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...
متن کاملDynamic Inertia Weight Particle Swarm Optimization for Solving Nonogram Puzzles
Particle swarm optimization (PSO) has shown to be a robust and efficient optimization algorithm therefore PSO has received increased attention in many research fields. This paper demonstrates the feasibility of applying the Dynamic Inertia Weight Particle Swarm Optimization to solve a Non-Polynomial (NP) Complete puzzle. This paper presents a new approach to solve the Nonograms Puzzle using Dyn...
متن کاملParticle Swarm Optimization with Inertia Weight and Constriction Factor
In the original Particle Swarm Optimization (PSO) formulation, convergence of a particle towards its attractors is not guaranteed. A velocity constraint is successful in controlling the explosion, but not in improving the fine-grain search. Clerc and Kennedy studied this system, and proposed constriction methodologies to ensure convergence and to fine tune the search. Thus, they developed diffe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2016
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0161558