Community detection is one of the most fundamental applications in understanding the structure of complicated networks. Furthermore, it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships. Networking structures are highly sensitive in social networks, requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks. In addition, they miss out on accurately identifying clusters. Since single-objective optimization cannot always generate accurate and comprehensive results, as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them. In this study, we utilized the intra function, which has proven effective in state-of-the-art research studies.We proposed a newinter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is tomake themmore distinct and sparse. Furthermore, we proposed a Multi-Objective community strength enhancement algorithm (MOCSE). The proposed algorithmis based on the framework of theMulti-Objective Evolutionary Algorithmwith Decomposition (MOEA/D), integrated with a new heuristic mutation strategy, community strength enhancement (CSE). The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient. The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information (NMI) and modularity (Q). It was tested using five state-of-the-art algorithms on social networks, comprising real datasets (Zachary,Dolphin, Football,Krebs, SFI, Jazz, andNetscience), aswell as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.
