<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wikimd.org/index.php?action=history&amp;feed=atom&amp;title=Particle_swarm_optimization</id>
	<title>Particle swarm optimization - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wikimd.org/index.php?action=history&amp;feed=atom&amp;title=Particle_swarm_optimization"/>
	<link rel="alternate" type="text/html" href="https://wikimd.org/index.php?title=Particle_swarm_optimization&amp;action=history"/>
	<updated>2026-05-10T07:42:56Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.44.2</generator>
	<entry>
		<id>https://wikimd.org/index.php?title=Particle_swarm_optimization&amp;diff=5884752&amp;oldid=prev</id>
		<title>Prab: CSV import</title>
		<link rel="alternate" type="text/html" href="https://wikimd.org/index.php?title=Particle_swarm_optimization&amp;diff=5884752&amp;oldid=prev"/>
		<updated>2024-06-05T19:56:02Z</updated>

		<summary type="html">&lt;p&gt;CSV import&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;[[File:ParticleSwarmArrowsAnimation.gif|thumb|ParticleSwarmArrowsAnimation]] [[file:PSO_Meta-Fitness_Landscape_(12_benchmark_problems).JPG|right|thumb|PSO_Meta-Fitness_Landscape_(12_benchmark_problems)]]   {{Short description|Optimization algorithm}}&lt;br /&gt;
{{Infobox algorithm&lt;br /&gt;
| name = Particle Swarm Optimization&lt;br /&gt;
| image = &lt;br /&gt;
| caption = &lt;br /&gt;
| class = [[Optimization algorithm]]&lt;br /&gt;
| creator = [[James Kennedy (social psychologist)|James Kennedy]] and [[Russell Eberhart]]&lt;br /&gt;
| year = 1995&lt;br /&gt;
| genre = [[Swarm intelligence]]&lt;br /&gt;
| license = &lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Particle Swarm Optimization&amp;#039;&amp;#039;&amp;#039; (&amp;#039;&amp;#039;&amp;#039;PSO&amp;#039;&amp;#039;&amp;#039;) is a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. PSO optimizes a problem by having a population of candidate solutions, here dubbed particles, and moving these particles around in the search-space according to simple mathematical formulae over the particle&amp;#039;s position and velocity. Each particle&amp;#039;s movement is influenced by its local best known position, but is also guided toward the best known positions in the search-space, which are updated as better positions are found by other particles. This is expected to move the swarm toward the best solutions.&lt;br /&gt;
&lt;br /&gt;
== History ==&lt;br /&gt;
PSO was introduced by [[James Kennedy (social psychologist)|James Kennedy]] and [[Russell Eberhart]] in 1995. The algorithm was inspired by the social behavior of birds flocking or fish schooling.&lt;br /&gt;
&lt;br /&gt;
== Algorithm ==&lt;br /&gt;
The PSO algorithm initializes a group of particles (solutions) and then iteratively moves these particles around the search-space. Each particle adjusts its position based on its own experience and the experience of neighboring particles, making use of the best position encountered by itself and its neighbors.&lt;br /&gt;
&lt;br /&gt;
=== Initialization ===&lt;br /&gt;
Each particle is initialized with a random position and velocity. The particles are then evaluated using a fitness function that measures the quality of the solution.&lt;br /&gt;
&lt;br /&gt;
=== Update Rules ===&lt;br /&gt;
The velocity and position of each particle are updated using the following equations:&lt;br /&gt;
* Velocity update: &lt;br /&gt;
 \[ v_{i}(t+1) = w \cdot v_{i}(t) + c_1 \cdot r_1 \cdot (p_{i} - x_{i}(t)) + c_2 \cdot r_2 \cdot (g - x_{i}(t)) \]&lt;br /&gt;
* Position update:&lt;br /&gt;
 \[ x_{i}(t+1) = x_{i}(t) + v_{i}(t+1) \]&lt;br /&gt;
&lt;br /&gt;
Where:&lt;br /&gt;
* \( v_{i}(t) \) is the velocity of particle \( i \) at time \( t \)&lt;br /&gt;
* \( x_{i}(t) \) is the position of particle \( i \) at time \( t \)&lt;br /&gt;
* \( p_{i} \) is the best known position of particle \( i \)&lt;br /&gt;
* \( g \) is the global best known position&lt;br /&gt;
* \( w \) is the inertia weight&lt;br /&gt;
* \( c_1 \) and \( c_2 \) are cognitive and social coefficients&lt;br /&gt;
* \( r_1 \) and \( r_2 \) are random numbers between 0 and 1&lt;br /&gt;
&lt;br /&gt;
=== Termination ===&lt;br /&gt;
The algorithm terminates when a stopping criterion is met, such as a maximum number of iterations or a satisfactory fitness level.&lt;br /&gt;
&lt;br /&gt;
== Applications ==&lt;br /&gt;
PSO has been applied to a wide range of optimization problems, including:&lt;br /&gt;
* [[Function optimization]]&lt;br /&gt;
* [[Neural network]] training&lt;br /&gt;
* [[Fuzzy system]] control&lt;br /&gt;
* [[Robotics]]&lt;br /&gt;
* [[Signal processing]]&lt;br /&gt;
&lt;br /&gt;
== Advantages and Disadvantages ==&lt;br /&gt;
=== Advantages ===&lt;br /&gt;
* Simple to implement&lt;br /&gt;
* Few parameters to adjust&lt;br /&gt;
* Effective for a wide range of problems&lt;br /&gt;
&lt;br /&gt;
=== Disadvantages ===&lt;br /&gt;
* May converge prematurely&lt;br /&gt;
* Performance can be sensitive to parameter settings&lt;br /&gt;
&lt;br /&gt;
== Variants ==&lt;br /&gt;
Several variants of PSO have been developed to improve its performance, including:&lt;br /&gt;
* [[Discrete Particle Swarm Optimization]]&lt;br /&gt;
* [[Multi-objective Particle Swarm Optimization]]&lt;br /&gt;
* [[Hybrid Particle Swarm Optimization]]&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Genetic algorithm]]&lt;br /&gt;
* [[Ant colony optimization]]&lt;br /&gt;
* [[Simulated annealing]]&lt;br /&gt;
* [[Differential evolution]]&lt;br /&gt;
&lt;br /&gt;
== Related Pages ==&lt;br /&gt;
* [[Swarm intelligence]]&lt;br /&gt;
* [[Optimization algorithm]]&lt;br /&gt;
* [[James Kennedy (social psychologist)]]&lt;br /&gt;
* [[Russell Eberhart]]&lt;br /&gt;
* [[Function optimization]]&lt;br /&gt;
* [[Neural network]]&lt;br /&gt;
* [[Fuzzy system]]&lt;br /&gt;
* [[Robotics]]&lt;br /&gt;
* [[Signal processing]]&lt;br /&gt;
&lt;br /&gt;
[[Category:Optimization algorithms]]&lt;br /&gt;
[[Category:Swarm intelligence]]&lt;br /&gt;
[[Category:Evolutionary algorithms]]&lt;br /&gt;
[[Category:1995 introductions]]&lt;br /&gt;
&lt;br /&gt;
{{Swarm-intelligence-stub}}&lt;/div&gt;</summary>
		<author><name>Prab</name></author>
	</entry>
</feed>