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
This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f
... Show MoreA new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever
... Show MoreEvolutionary algorithms are better than heuristic algorithms at finding protein complexes in protein-protein interaction networks (PPINs). Many of these algorithms depend on their standard frameworks, which are based on topology. Further, many of these algorithms have been exclusively examined on networks with only reliable interaction data. The main objective of this paper is to extend the design of the canonical and topological-based evolutionary algorithms suggested in the literature to cope with noisy PPINs. The design of the evolutionary algorithm is extended based on the functional domain of the proteins rather than on the topological domain of the PPIN. The gene ontology annotation in each molecular function, biological proce
... Show MoreEvolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E
... Show More