更改

A basic variant  of the PSO algorithm works by having a population (called a swarm) of candidate solutions (called particles). These particles are moved around in the search-space according to a few simple formulae. The movements of the particles are guided by their own best known position in the search-space as well as the entire swarm's best known position. When improved positions are being discovered these will then come to guide the movements of the swarm. The process is repeated and by doing so it is hoped, but not guaranteed, that a satisfactory solution will eventually be discovered.

A basic variant  of the PSO algorithm works by having a population (called a swarm) of candidate solutions (called particles). These particles are moved around in the search-space according to a few simple formulae. The movements of the particles are guided by their own best known position in the search-space as well as the entire swarm's best known position. When improved positions are being discovered these will then come to guide the movements of the swarm. The process is repeated and by doing so it is hoped, but not guaranteed, that a satisfactory solution will eventually be discovered.

粒子群优化算法的一个基本变种是通过一个候选解(称为粒子)的群体来工作。这些粒子会根据几个简单的公式在搜索空间中进行移动。它们的运动受到搜索空间中自身附近的最优位置以及所有粒子的最优位置的引导。当更好的位置被发现时，群体便会朝向这些位置运动。这一过程将不断重复进行去寻找最优解，但不能保证最终一定会找到。

粒子群优化算法的一个基本变种是通过一个候选解(称为粒子)的总体（称为群体）来工作。这些粒子会根据几个简单的公式在搜索空间中进行移动。它们的运动受到搜索空间中自身附近的最优位置以及所有粒子的最优位置的引导。当更好的位置被发现时，群体便会朝向这些位置运动。这一过程将不断重复进行去寻找最优解，但不能保证最终一定会找到。

==[[用户:Yuling|Yuling]]（[[用户讨论:Yuling|讨论]]）“粒子群优化算法的一个基本变种是通过一个候选解(称为粒子)的群体来工作”，这句话里面的population和swarm有点区分不开。

==[[用户:Yuling|Yuling]]（[[用户讨论:Yuling|讨论]]）“粒子群优化算法的一个基本变种是通过一个候选解(称为粒子)的群体来工作”，这句话里面的population和swarm有点区分不开。