Community structures are fundamental in understanding the structure and functionality of complex networks. Different optimization algorithms, including both single-objective and multi-objective approaches, have been employed to address the challenge of community detection. Recently, multi-objective evolutionary algorithms (MOEAs) have attracted many researchers to identify communities in static networks. Many algorithms have been proposed to find a solution that achieves a trade-off between exploring new areas of the solution space and improving the quality of existing solutions. In this trade-off is crucial; whereas exploitation improves existing solutions, it may fail to find better solutions from insufficiently explored regions of the solution space. Therefore, mutation in evolutionary algorithms greatly impacts community detection within social networks. Conventional mutation methods usually tend to apply too much randomness, which results in convergence being less precise about finding a suitable optimum solution. This paper introduces a new mutation called community strength enhancement (CSE) to enhance the search efficiency of the Multi-Objective Evolutionary Algorithm with Decomposition (MOEA/D) and speed up the convergence of the suggested algorithm. Moreover, the proposed algorithm overcomes the limitations of traditional MOEA/D by accurately and effectively identifying communities across a wide range of social networks. The enhanced algorithm was evaluated on two groups of datasets (twenty synthetic and four real-world) using normalized mutual information (NMI) and modularity (Q) across five baseline models. Integrating the CSE mutation strategy led to significant improvements in performance, particularly under high mixing parameters and in large-scale networks, as evidenced by increased NMI and modularity scores
Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem. In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a
... Show MoreA Strength Pareto Evolutionary Algorithm 2 (SPEA 2) approach for solving the multi-objective Environmental / Economic Power Dispatch (EEPD) problem is presented in this paper. In the past fuel cost consumption minimization was the aim (a single objective function) of economic power dispatch problem. Since the clean air act amendments have been applied to reduce SO2 and NOX emissions from power plants, the utilities change their strategies in order to reduce pollution and atmospheric emission as well, adding emission minimization as other objective function made economic power dispatch (EPD) a multi-objective problem having conflicting objectives. SPEA2 is the improved version of SPEA with better fitness assignment, density estimation, an
... Show MoreThis paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord
... Show MoreMany industrial systems involve multiple criteria and objectives, and they are very complex problems in computational science, such as task scheduling. We propose bi-criteria and bi-objective scheduling problems, which are solved by two nature-inspired evolutionary algorithms, such as Simulated Annealing (SA) and Bee Algorithm (BA). This problem is characterized by scheduling a batch of tasks on multiple machines, and it is fundamental because the solution should focus on the simultaneous optimization of two conflicting objectives: the makespan minimization and the total tardiness minimization. This problem is NP-Hard, and therefore, two evolutionary methods were used to search for solutions intelligently in this huge, very complex
... Show MoreIn recent years, the evolution of the community structure in social networks has gained significant attention. Due to the rapid and continuous evolution of real-world networks over time. This makes the process of identifying communities and tracking their topology changes challenging. To tackle these challenges, it is necessary to find efficient methodologies for analyzing the behavior patterns of dynamic communities. Several previous reviews have introduced algorithms and models for community detection. However, these methods have not been very accurate in identifying communities. Moreover, none of the reviewed papers made an apparent effort to link algorithms that can accurately detect dynamic communities. This review aims to present a ta
... Show More