说明：  子群优化算法中,粒子群由多个粒子组成,每个粒子的位置代表优化问题在D维搜索空间中潜在的解。根据各自的位置,每个粒子用一个速度来决定其飞行的方向和距离,然后通过优化函数计算出一个适应度函数值(fitness)。
(Subgroup of particle swarm optimization algorithm is composed by a number of particles, each particle' s position represents to optimize the potential of the solution of the problem in the D-dimensional search space. According to the respective positions of each particle is determined with a speed of its flight direction and distance, and then through the optimization function to calculate a fitness function value (fitness).)