Detecting community structures helps to reveal the functional units of complex networks. In this paper, the community detection problem is regarded as a modularity-based multi-objective optimization problem (MOP), and a parallel conical area community detection algorithm (PCACD) is designed to solve this MOP effectively and efficiently. In consideration of the global properties of the selection and update mechanisms, PCACD employs a global island model and targeted elitist migration policy in a conical area evolutionary algorithm (CAEA) to discover community structures at different resolutions in parallel. Although each island is assigned only a portion of all sub-problems in the island model, it preserves a complete population to accomplish the global selection and update. Meanwhile the migration policy directly migrates each elitist individual to an appropriate island in charge of the sub-problem associated with this individual to share essential evolutionary achievements. In addition, a modularity-based greedy local search strategy is also applied to accelerate the convergence rate. Comparative experimental results on six real-world networks reveal that PCACD is capable of discovering potential high-quality community structures at diverse resolutions with satisfactory running efficiencies.
The constraint‐handling methods using multiobjective techniques in evolutionary algorithms have drawn increasing attention from researchers. This paper proposes an efficient conical area differential evolution (CADE) algorithm, which employs biased decomposition and dual populations for constrained optimization by borrowing the idea of cone decomposition for multiobjective optimization. In this approach, a conical subpopulation and a feasible subpopulation are designed to search for the global feasible optimum, along the Pareto front and the feasible segment, respectively, in a cooperative way. In particular, the conical subpopulation aims to efficiently construct and utilize the Pareto front through a biased cone decomposition strategy and conical area indicator. Neighbors in the conical subpopulation are fully exploited to assist each other to find the global feasible optimum. Afterwards, the feasible subpopulation is ranked and updated according to a tolerance‐based rule to heighten its diversity in the early stage of evolution. Experimental results on 24 benchmark test cases reveal that CADE is capable of resolving the constrained optimization problems more efficiently as well as producing solutions that are significantly competitive with other popular approaches.