以旅行商问题为例,提出了一种离散粒子群优化算法,对粒子的位置、速度等量及其运算规则进行了定义,为抑制早熟停滞现象,分别定义了粒子群多样性指标,并在迭代过程中采用扰动保持粒子群的多样性,使算法在空间探索和局部求精间取得了很好的平衡,仿真结果表明,该算法具有很好的性能。
The traveling salesman problem as an example, a discrete particle swarm optimization algorithm is present. The particle's position, velocity and the operation rules are defined in this paper. For the inhibition of premature stagnation, the diversity index of the particle swarm is defined and disturbance in the iteration process is used to maintain the diversity. The algorithm achieved a good balance between space exploration and the local refinement. Simulation results show that the algorithm has better performance.