Uncovering the social interaction network in swarm intelligence algorithms

This is the final version. Available from the publisher via the DOI in this record.Swarm intelligence is the collective behavior emerging in systems with locally interacting components. Because of their self-organization capabilities, swarm-based systems show essential properties for handling real-world problems, such as robustness, scalability, and flexibility. Yet, we fail to understand why swarm-based algorithms work well, and neither can we compare the various approaches in the literature. The absence of a common framework capable of characterizing these several swarm-based algorithms, transcending their particularities, has led to a stream of publications inspired by different aspects of nature without a systematic comparison over existing approaches. Here we address this gap by introducing a network-based framework—the swarm interaction network—to examine computational swarm-based systems via the optics of the social dynamics. We investigate the structure of social interaction in four swarm-based algorithms, showing that our approach enables researchers to study distinct algorithms from a common viewpoint. We also provide an in-depth case study of the Particle Swarm Optimization, revealing that different communication schemes tune the social interaction in the swarm, controlling the swarm search mode. With the swarm interaction network, researchers can study swarm algorithms as systems, removing the algorithm particularities from the analyses while focusing on the structure of the swarm social interaction

A Complex Neighborhood Based Particle Swarm Optimization

This paper proposes a new variant of the PSO algorithm named Complex Neighborhood Particle Swarm Optimizer (CNPSO) for solving global optimization problems. In the CNPSO, the neighborhood of the particles is organized through a complex network which is modified during the search process. This evolution of the topology seeks to improve the influence of the most successful particles and it is fine tuned for maintaining the scale-free characteristics of the network while the optimization is being performed. The use of a scale-free topology instead of the usual regular or global neighborhoods is intended to bring to the search procedure a better capability of exploring promising regions without a premature convergence, which would result in the procedure being easily trapped in a local optimum. The performance of the CNPSO is compared with the standard PSO on some wellknown and high-dimensional benchmark functions, ranging from multimodal to plateau-like problems. In all the cases theCNPSO outperformed the standard PSO. © 2009 IEEE.720727Barab́asi, L., (2003) Linked: How Everything Is Connected to Everything Else and What It Means for Business, Science, and Everyday Life, , Plume Books, AprilBarab́asi, A.-L., Albert, R., Emergence of scaling in random networks (1999) Science, 286 (5439), pp. 509-512. , OctoberBarabási, A.-L., Jeong, H., Neda, Z., Ravasz, E., Schubert, A., Vicsek, T., Evolution of the social network of scientific collaborations (2002) Physica A, 311, p. 3Carlisle, A., Dozier, G., An off-the-shelf PSO (2001) Proceedings of the Workshop on Particle Swarm Optimization, pp. 1-6Clerc, M., Kennedy, J., The particle swarm - explosion, stability, and convergence in a multidimensional complex space (2002) Evolutionary Computation, IEEE Transactions on, 6 (1), pp. 58-73Dorogovtsev, S.N., Mendes, J.F.F., Evolution of networks (2001) ArXiv Condensed Matter e-prints, , JuneEberhart, R., Kennedy, J., A new optimizer using particle swarm theory (1995) Micro Machine and Human Science 1995. MHS '95., Proceedings of the Sixth International Symposium on, pp. 39-43Eberhart, R.C., Shi, Y., Comparing inertia weights and constriction factors in particle swarm optimization (2000) Evolutionary Computation 2000. Proceedings of the 2000 Congress on, 1, pp. 84-88. , volume 1Erdos, P., Ŕenyi, A., On random graphs (1959) Publicationes Mathematicae (Debrecen), 6, pp. 290-297Est́evez, P.A., Vera, P.A., Saito, K., Selecting the most influential nodes in social networks (2007) Proceedings of the International Joint Conference on Neural Networks, pp. 2397-2402Faloutsos, M., Faloutsos, P., Faloutsos, C., On power-law relationships of the internet topology (1999) SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pp. 251-262. , New York, NY, USA, ACMHoll, J., Handcock, M.S., An assessment of preferential attachment as a mechanism for human sexual network formation (2003) Technical report University of WashingtonKennedy, J., Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance (1999) Congress on Evolutionary Computation, 3, pp. 1931-1938Kennedy, J., Dynamic-probabilistic particle swarms (2005) GECCO '05: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, pp. 201-207. , New York, NY, USA, ACMKennedy, J., Eberhart, R., Particle swarm optimization (1995) Neural Networks, 1995. Proceedings., IEEE International Conference on, 4, pp. 1942-1948. , volume 4Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S., Particle swarm optimization algorithms with novel learning strategies (2004) SMC(4), pp. 3659-3664Lilijeros, F., Edling, C., Amaral, L., Stanley, E., Åberg, Y., The web of human sexual contacts (2001) Nature, 411, pp. 907-908Montoya, J.M., Soĺe, R.V., Small world patterns in food webs (2002) Journal of Theoretical Biology, 214 (3), pp. 405-412. , FebruaryNewman, M.E.J., The structure of scientific collaboration networks (2001) Proc. Natl. Acad. Sci. USA, 98, pp. 404-409. , JulNewman, M.E.J., The structure and function of complex networks (2003) SIAM Review, 45, pp. 167-256Paine, R.W., Tani, J., How hierarchical control self-organizes in artificial adaptive systems (2005) Adaptive Behavior, 13 (3), pp. 211-225. , SeptemberPant, M., Thangaraj, R., Abraham, A., A new quantum behaved particle swarm optimization (2008) GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pp. 87-94. , New York, NY, USA, ACMPimm, S.L., (1982) Food Webs, , Population and Community Biology Series. Kluwer Academic Publishers GroupRapoport, A., Horvath, W., A study of a large sociogram (1961) Behavioral Science, 6Shang, Y.-W., Qiu, Y.-H., A note on the extended Rosenbrock function (2006) Evol. Comput., 14 (1), pp. 119-126Shen-Orr, S.S., Milo, R., Mangan, S., Alon, U., Network motifs in the transcriptional regulation network of Escherichia coli (2002) Nat Genet, 31 (1), pp. 64-68. , MayToscano-Pulido, G., Coello-Coello, C.A., A constraint-handling mechanism for particle swarm optimization (2004) Proceedings of the Congress on Evolutionary Computation 2004 (CEC'2004), 2, pp. 1396-1403. , IEEE, JuneWatts, D.J., Strogatz, S.H., Collective dynamics of small-world networks (1998) Nature, 393 (6684), pp. 440-442. , Jun