For fast convergence and prone to premature phenomenon of particle swarm optimization
proposed a small-world particle swarm optimization with a Rule of degree.The particle swarm distributions use the model of small world network. Give a rule for small-worlds random connection
the biggest degree connect to the smallest
making communication more effective between particles
avoiding rapid convergence and has a balance of diversity of particle swarm. Using the standard function to test it
the experimental results show that the particle swarm not easy to fall into local optimum and better finding optimal solution. A small-world particle swarm optimization with a rule of degree is better than the conventional particle swarm algorithm.
Guangquan Xu, Chao Xu. PSO-TPS: An optimal trust path selection algorithm based on particle swarm optimization in small world network[C]// Proceedings - 2nd International Conference on Cloud and Green Computing and 2nd International Conference on Social Computing and Its Applications. Xiangtan: IEEE, 2012: 594-600.
Watts DJ, Strogetz S. Collective dynamics of small-worldnetworks[J]. Nature, 1998, 393(4): 440-442. DOI: 440
Newman MEJ, Watts DJ. Renormalization group analysis of the small-world network model[J]. Phy Lett A, 1999, 263(4): 341-346. DOI: 341
Ming Li, Wenqiang Du, Fuzhong Nian. An adaptive particle swarm optimization algorithm based on directed weighted complex network[J]. Mathematical Problems in Engineering, 2014, 2014(4): 1-7. DOI: 1