.png){kind=icon}
.png){kind=icon}
Return
A cascade evolutionary algorithm for the bodyguard allocation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2015.08.056.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The bodyguard allocation problem (BAP) is an optimization problem that illustrates the behavior of processes with contradictory individual goals in some distributed systems. The objective function of this problem is the maximization of a parameter called the social welfare. Although the main method proposed to solve this problem, known as CBAP, is simple and time efficient, it lacks the ability to generate a diverse set of solutions, which is one of the most important feature to improve the chances to reach the global optimum. To overcome this drawback, we address the BAP with an evolutionary algorithm, the EBAP. Later, we take advantage of the best properties of both algorithms, EBAP and CBAP, to generate a two-stage cascade evolutionary algorithm called FFC-BAP. Extensive experimental results show that the algorithm FFC-BAP outperforms both the EBAP and the CBAP, in terms of quality of solutions. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Bodyguard allocation problem
Evolutionary algorithm
Cascade evolutionary algorithm
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