• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2012, Vol. 34 ›› Issue (7): 160-165.

• 论文 • Previous Articles     Next Articles

Adaptive PSO Based on Swarm Diversity for VRPSPD

LUO Dongsheng,LIU Yanmin     

  1. (School of Mathematics and Computer Science,Zunyi Normal College,Zunyi 563002,China)
  • Online:2012-07-25 Published:2012-07-15

Abstract:

In order to solve effectively the vehicle routing with simultaneous delivery and pickup problem (VRPSPD), an adaptive PSO based on swarm diversity is proposed(SDAPSO). In SDAPSO, the global distance disturbance is made for the worst particles in terms of swarm diversity, which improves these particles’ ability of searching the global optimal solution. And the probability disturbance is introduced for the best performing particle (gbest) in the whole swarm to increase the diversity of swarm. In the benchmark function, the results show that SDAPSO is an effective improved algorithm compared with the basic PSO. In VRPSPD, the proposed algorithm achieves a better solution compared with other algorithms.