×

A novel PSO model based on simulating human social communication behavior. (English) Zbl 1253.90217

Summary: In order to solve the complicated multimodal problems, this paper presents a variant of particle swarm optimizer (PSO) based on the simulation of the human social communication behavior (HSCPSO). In HSCPSO, each particle initially joins a default number of social circles (SC) that consist of some particles, and its learning exemplars include three parts, namely, its own best experience, the experience of the best performing particle in all SCs, and the experiences of the particles of all SCs it is a member of. The learning strategy takes full advantage of the excellent information of each particle to improve the diversity of the swarm to discourage premature convergence. To weight the effects of the particles on the SCs, the worst performing particles will join more SCs to learn from other particles and the best performing particles will leave SCs to reduce their strong influence on other members. Additionally, to insure the effectiveness of solving multimodal problems, the novel parallel hybrid mutation is proposed to improve the particle’s ability to escape from the local optima. Experiments were conducted on a set of classical benchmark functions, and the results demonstrate the good performance of HSCPSO in escaping from the local optima and solving the complex multimodal problems compared with the other PSO variants.

MSC:

90C59 Approximation methods and heuristics in mathematical programming
91D30 Social networks; opinion dynamics
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942-1948, December 1995.
[2] R. Eberhart and Y. Shi, “Comparison between genetic algorithms and particle swarm optimization,” in Proceedings of the 7th Annual Conference on Evolutionary Programming, San Diego, Calif, USA, 1998.
[3] M. Clerc and J. Kennedy, “The particle swarm-explosion, stability, and convergence in a multidimensional complex space,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 58-73, 2002. · Zbl 05451976 · doi:10.1109/4235.985692
[4] J. Kennedy and R. Mendes, “Population structure and particle swarm performance,” in Proceedings of the IEEE Congress on Evolution Computation, pp. 1671-1676, Honolulu, Hawaii, USA, 2002.
[5] J. Sun, J. Liu, and W. Xu, “Using quantum-behaved particle swarm optimization algorithm to solve non-linear programming problems,” International Journal of Computer Mathematics, vol. 84, no. 2, pp. 261-272, 2007. · Zbl 1116.65072 · doi:10.1080/00207160601170254
[6] P. J. Angeline, “Using selection to improve particle swarm optimization,” in Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC’98), pp. 84-89, Anchorage, Alaska, USA, May 1998.
[7] M. Lovbjerg and T. Krink, “Hybrid particle swarm optimizer with breeding and subpopulations,” in Proceeding of the Genetic Evolution Computation Conference, pp. 469-476, 2001.
[8] A. Stacey and M. Jancic, “Particle swarm optimization with mutation,” in Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1425-1430, Canberra, Australia, 2003.
[9] P. S. Andrews, “An investigation into mutation operators for particle swarm optimization,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC’06), pp. 1044-1051, July 2006.
[10] P. N. Suganthan, “Particle swarm optimizer with neighborhood operator,” in Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1958-1962, Washington, DC, USA, 1999.
[11] X. Hu and R. C. Eberhart, “Multiobjective optimization using dynamic neighborhood particle swarm optimization,” in Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1677-1681, Honolulu, Hawaii, USA, 2002.
[12] J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, “Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 3, pp. 281-295, 2006. · Zbl 05452113 · doi:10.1109/TEVC.2005.857610
[13] T. Peram and K. Veeramachaneni, “Fitness-distance-ratio based particle swarm optimization,” in Proceeding of the IEEE Swarm Intelligence Symposium, pp. 174-181, April 2003.
[14] A. S. Mohais, R. Mendes, C. Ward, and C. Posthoff, “Neighborhood re-structuring in particle swarm optimization,” in AI 2005: Advances in Artificial Intelligence, vol. 3809 of Lecture Notes in Computer Science, pp. 776-785, Springer, Berlin, Germany, 2005. · Zbl 1175.68422 · doi:10.1007/11589990
[15] S. Janson and M. Middendorf, “A hierarchical particle swarm optimizer and its adaptive variant,” IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 35, no. 6, pp. 1272-1282, 2005. · doi:10.1109/TSMCB.2005.850530
[16] W. Elshamy, H. M. Emara, and A. Bahgat, “Clubs-based particle swarm optimization,” in Proceedings of the IEEE Swarm Intelligence Symposium (SIS’07), pp. 289-296, Honolulu, Hawaii, USA, April 2007. · doi:10.1109/SIS.2007.367950
[17] R. Mendes, J. Kennedy, and J. Neves, “The fully informed particle swarm: simpler, maybe better,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 204-210, 2004. · Zbl 05451994 · doi:10.1109/TEVC.2004.826074
[18] F. van den Bergh and A. P. Engelbrecht, “A cooperative approach to participle swam optimization,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 225-239, 2004. · Zbl 05452218 · doi:10.1109/TEVC.2004.826069
[19] S. Z. Zhao, J. J. Liang, P. N. Suganthan, and M. F. Tasgetiren, “Dynamic multi-swarm particle swarm optimizer with local search for large scale global optimization,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC’08), pp. 3845-3852, Hong Kong, China, June 2008. · doi:10.1109/CEC.2008.4631320
[20] Y. M. Liu, Q. Z. Zhao, C. L. Sui, and Z. Z. Shao, “Particle swarm optimizer based on dynamic neighborhood topology and mutation operator,” Control and Decision, vol. 25, no. 7, pp. 968-974, 2010.
[21] R. Salomon, “Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms,” BioSystems, vol. 39, no. 3, pp. 263-278, 1996. · doi:10.1016/0303-2647(96)01621-8
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.