الگوریتم های ابتکاری کارآمد برای اصلاح مشکل آسیب پذیری آبشار برای شبکه های به هم پیوسته

In this paper, the general Cascade Vulnerability Problem is presented, and the basic properties of the most important detection and correction algorithms are briefly described. Two new efficient heuristic algorithms are proposed for correcting the Cascade Vulnerability Problem: (a) a conceptually simple and computationally fast Combinatorial Algorithm based on a reduction of the Cascade Vulnerability Correction Problem to Weighted Vertex Cover, and (b) a simple and easy to implement Genetic Algorithm based on the Combinatorial Algorithm. The new algorithms are experimentally evaluated on a collection of randomly generated instances consisting of networks of various characteristics. The experiments demonstrate that the Combinatorial Algorithm is extremely fast but sometimes fails to produce low-cost solutions. On the other hand, the Genetic Algorithm is significantly slower but consistently computes much better solutions.