arrow
Return

Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem

delete2012-11-01
delete77
PRE
AI
M
Mario Ventresca *
DOI:10.1016/j.cor.2012.02.008delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper the problem of critical node detection (CNDP) is approached using population-based incremental learning (an estimation of distribution algorithm) and simulated annealing optimization algorithms using a combinatorial unranking-based problem representation. This representation is space-efficient and alleviates the need for any repair mechanisms. CNDP is a very recently proposed problem that aims to identify a vertex set V' subset of V of k > 0 nodes from a given graph G = (V,E) such that G(V\V') has minimum pairwise connectivity. Numerous practical applications for this problem exist, including pandemic disease mitigation, computer security and anti-terrorism. In order to test the proposed heuristics 16 benchmark random graph structures are additionally proposed that utilize Erdos-Renyi, Watts-Strogatz, Forest Fire and Barabasi-Albert models. Each of these models presents different network characteristics, yielding variations in problem difficulty. The relative merits of the two proposed approaches are compared and it is found that the population-based incremental learning approach, using a windowed perturbation operator is able to outperform the proposed simulated annealing method. (c) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Critical node detection
Complex networks
Random graph
Simulated annealing
Population-based incremental learning
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

No organization information available
Cited Papers

Cited Papers

Detecting critical nodes in sparse graphs
err2009-07-01
err292
PREAI
errArulselvan, Ashwin; Commander, Clayton W.; Elefteriadou, Lily; Pardalos, Panos M.
errShare
errSave
errShare
errSave
Complexity of the critical node problem over trees
err2011-12-01
err64
errOAAI
errDi Summa, Marco; Grosso, Andrea; Locatelli, Marco
errShare
errSave
A novel snoRNA (U73) is encoded within the introns of the human and mouse ribosomal protein S3a genes
errGene
IF0
err1998-04-01
err0
PREAI
errAna Rebane; Richard Tamme; Maris Laan; Illar Pata; Andres Metspalu
errShare
errSave
Tuberculina: rust relatives attack rusts
err2017-01-30
err0
PREAI
errMatthias Lutz; Robert Bauer; Dominik Begerow; Franz Oberwinkler; Dagmar Triebel
errShare
errSave
Protein Tyrosine Phosphatase δ Mediates the Sema3A-Induced Cortical Basal Dendritic Arborization through the Activation of Fyn Tyrosine Kinase
err2017-06-21
err0
errOAAI
errFumio Nakamura; Takako Okada; Maria Shishikura; Noriko Uetani; Masahiko Taniguchi; Takeshi Yagi; Yoichiro Iwakura; Toshio Ohshima; Yoshio Goshima; Stephen M. Strittmatter
errShare
errSave
OPTIMIZATION BY SIMULATED ANNEALING
errSCIENCE
IF45.8
err1983-05-13
err3.2W
PREAI
errKIRKPATRICK, S; GELATT, CD; VECCHI, MP
errShare
errSave
researcher View more