{"title":"A multifactorial evolutionary algorithm to detect stably influential seeds from competitive networks under multiple damage scenarios","authors":"Shuai Wang, Junru Tang, Xiaojun Tan, Mengtang Li","doi":"10.1016/j.swevo.2025.102187","DOIUrl":null,"url":null,"abstract":"<div><div>The complex network has garnered significant attention over the past few decades, with optimization and information extraction problems show significance in practical applications. The competitive influence maximization, along with its robustness, has emerged as a recent focal point, which is aimed at identifying seeds with robust and influential capabilities across multiple propagative groups within a specific network. Existing studies indicate the damage percentage of link-based failures can be pre-defined, and solving the problem in a single-objective manner. However, it has been demonstrated that multiple damage scenarios are prevalent, and the corresponding search processes may yield the synergy. Therefore, the correlation between the optimization directed at different damage scenarios of link-based attacks is analyzed first, which has shown non-conflict relation. Consequently, the multitasking optimization paradigm is thus introduced to modeling the related robust influence maximization problem. A numerical metric is also designed to reflect the significance of links on competitive networks. Equipped with this metric, a multifactorial evolutionary algorithm has been developed to tackle the seed determination problem under multiple damage scenarios, termed MFEA-RCIM<sub>MD</sub>. The involved operators consider diverse information from both genetic and fitness domains, and a multi-phase transfer operation is included to leverage knowledge across different tasks. Experiments on synthetic and real-world networks demonstrate the remarkable performance of the algorithm over existing single-objective and multitasking approaches. With enhanced efficiency, multiple candidates are provided for decision-makers to address diffusive challenges in practical systems.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"99 ","pages":"Article 102187"},"PeriodicalIF":8.5000,"publicationDate":"2025-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S221065022500344X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
The complex network has garnered significant attention over the past few decades, with optimization and information extraction problems show significance in practical applications. The competitive influence maximization, along with its robustness, has emerged as a recent focal point, which is aimed at identifying seeds with robust and influential capabilities across multiple propagative groups within a specific network. Existing studies indicate the damage percentage of link-based failures can be pre-defined, and solving the problem in a single-objective manner. However, it has been demonstrated that multiple damage scenarios are prevalent, and the corresponding search processes may yield the synergy. Therefore, the correlation between the optimization directed at different damage scenarios of link-based attacks is analyzed first, which has shown non-conflict relation. Consequently, the multitasking optimization paradigm is thus introduced to modeling the related robust influence maximization problem. A numerical metric is also designed to reflect the significance of links on competitive networks. Equipped with this metric, a multifactorial evolutionary algorithm has been developed to tackle the seed determination problem under multiple damage scenarios, termed MFEA-RCIMMD. The involved operators consider diverse information from both genetic and fitness domains, and a multi-phase transfer operation is included to leverage knowledge across different tasks. Experiments on synthetic and real-world networks demonstrate the remarkable performance of the algorithm over existing single-objective and multitasking approaches. With enhanced efficiency, multiple candidates are provided for decision-makers to address diffusive challenges in practical systems.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.