计算机应用研究2012，Vol.29Issue(4)：1260-1262,1325,4.DOI:10.3969/j.issn.1001-3695.2012.04.016
基于复杂网络的应急物流网络抗毁性研究
Study on invulnerability of emergency logistics network based on complex network
摘要
Abstract
Aiming at the research of the invulnerability of emergency logistics network, this paper measured the network invulnerability quantitatively by the average inverse geodesic length and the size of the largest connected subgraph. It analyzed invulnerabilities of the emergency logistics network including single-point distribution center in deference attack strategies. For each case of attacks on vertices and edges, it used different attacking strategies; removals by the descending order of the degree and the betweenness centrality. It shows that random attacks are often less harmful than select attacks and the invulnerability is weak based on removals by recalculated degrees when more vertices are attacked.关键词
应急物流/复杂网络/抗毁性/介数/平均最短路径Key words
emergency logistics/ complex network/ invulnerability/ betweenness centrality/ average geodesic length分类
管理科学引用本文复制引用
陈春霞..基于复杂网络的应急物流网络抗毁性研究[J].计算机应用研究,2012,29(4):1260-1262,1325,4.基金项目
成都电子机械高等专科学校基金资助项目(KY09110161B) （KY09110161B）
