Community structure is an interesting feature of complex networks. The problem of community detection has attracted many research efforts in recent years. Most of the algorithms developed for this purpose take advantage of single-objective optimization methods which may be ineffective for complex networks. In this article, a novel multi-objective community detection method based on a modified version of particle swarm optimization, named MOPSO-Net is proposed. Kernel k-means (KKM) and ratio cut (RC) are employed as objective criteria to be minimized. Our innovation in PSO algorithm is changing the moving strategy of particles. Experiments on synthetic and real-world networks confirm a significant improvement in terms of normalized mutual information NMI and modularity in comparison with recent similar approaches
