.png){kind=icon}
.png){kind=icon}
Return
A Game-Theoretic Genetic Algorithm for the reliable server assignment problem under attacks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2015.02.028.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce the reliable server assignment problem considering attacks, which seeks to choose the locations of servers on a network in order to maximize the network reliability that results from a worst-case attack on the edges of the network. The problem is formulated on an unreliable network such that edges are subject to fail independently, and attacks increase the probability of failure for the attacked network edges. The reliability is measured by the critical service rate, which equals the probability that at least a fraction cc of the nodes in the network are connected to a server. We model this problem as a bi-level optimization problem, with the network designer acting as the leader and the attacker acting as the follower. The problem IN very difficult to solve, both because of its bi-level structure and because simply evaluating the critical Service rate for a single network configuration and attack is NP-hard. We propose a novel Game-Theoretic Genetic Algorithm (GTGA) that simultaneously maintains two populations, one for each player, which interact through a joint payoff matrix. We benchmark the GTGA against a more straightforward Nested GA (NGA) and find that the GTGA significantly outperforms the NGA in terms of solution quality with nearly identical CPU times. We also introduce an efficient simulation method to estimate the reliability for a given set of servers and integrate this into the GAs. We contribute to the literature on the reliable server assignment problem, as well as introducing a novel algorithmic approach that can be adapted to other hi-level optimization problems. (C) 2015 Elsevier Ltd. All rights reserved.
Keywords:
Network reliability
Network design
Bi-level optimization
Game theory
Genetic algorithms
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.5
Papers:
1.0W
Citations:
3.8W