基于复杂网络的应急物流网络抗毁性研究  

Study on invulnerability of emergency logistics network based on complex network

作　　者：陈春霞[1] 

机构地区：[1]成都电子机械高等专科学校机械工程系,成都611730

出　　处：《计算机应用研究》2012年第4期1260-1262,1325,共4页Application Research of Computers

基　　金：成都电子机械高等专科学校基金资助项目(KY09110161B)

摘　　要：基于复杂网络理论,引入平均最短路径距离和极大连通子图,研究应急物流网络的抗毁性测度模型,在最大度和介数等不同的攻击策略下分析了单点应急物流网络的抗毁性能。理论分析和实验结果表明,随机攻击的网络易毁性小于选择性攻击;在攻击较多顶点时,度攻击的抗毁性能较弱。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.

关 键 词：应急物流 复杂网络 抗毁性 介数 平均最短路径 

分 类 号：F250[经济管理—国民经济]