.png){kind=icon}
.png){kind=icon}
Return
Constrained evolutionary algorithms for epidemic spreading curing policy
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2020.106173.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The design and developments of policies aiming to control and contain spreading processes when resources are limited is an important problem in many application domains dealing with resource allocation, such as public health and network security. This problem, referred as Optimal Curing Policy (OCP) problem, can be formalized as a constrained minimization problem by relying on the approximated heterogeneous N-Intertwined Mean-Field Approximation (NIMFA) model of the SIS spreading process. In this paper, an approach which combines Differential Evolution and Genetic Algorithms is proposed to solve the OCP problem. The hybridization leverages the best characteristics of the two methods to produce high quality solutions in an efficient and effective way. An extensive experimentation on both real-world and synthetic networks shows that the approach is able to outperform a standard solver for semidefinite programming. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Epidemic spreading
Complex networks
NIMFA model
Differential evolution
Genetic algorithms
Simulated binary crossover
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W