期刊文献+

基于复杂网络的供应链网络效率研究 被引量:15

Supply Chain Network Efficiency Research Based on Complex Network
下载PDF
导出
摘要 研究复杂供应链网络的效率和重要节点识别问题。由于现代供应链网络的复杂性,以节点度分布作为衡量供应链枢纽节点,并不符合供应链运行的实际情况。传统的网络效率计算方法只是简单地进行"去边"和"去点"计算。为了解决上述问题,首先建立了一个典型供应链模型,然后提出了在突发情况下新的对于供应链网络效率计算方法。仿真结果表明,方法可以有效衡量供应链的网络效率,并能识别供应链网络中最具影响力的节点,从而能够针对性地对供应链网络进行防护,提高运行效率。 The network efficiency and key node identification of complex supply chain were studied. The tradi- tional network efficiency calculation method was simply based on "edge deletion" or "node deletion". Because of the complexity of the modern supply chain network, the method distinguishing the key node of supply chain based on the degree distribution, was not consistent with the actual operation of the supply chain. To solve the above problem, first, a typical model was established. Then a new network efficiency calculation method was put forward to calculate the supply chain model. Simulation result shows that this method can be used to measure the network efficiency and identify the most influential node. Thereby, it is helpful in protecting the supply chain network.
作者 贺磊 王直杰
出处 《计算机仿真》 CSCD 北大核心 2012年第8期183-186,共4页 Computer Simulation
关键词 供应链 复杂网络 网络效率 重要节点识别 Supply chain Complex network Network efficiency Key node identification
  • 相关文献

参考文献10

  • 1朱冰心,胡一竑.基于复杂网络理论的供应链应急管理研究[J].物流技术,2007,26(11):147-150. 被引量:22
  • 2A L Barabasi, E Bonabeau. Scale - free networks [ J ]. Scientific American, 2003,5 ( 1 ) : 60 - 69.
  • 3J Newman ME. The structure and function of complex networks [J]. SIAM Review, 2003,45(2) :167 -256.
  • 4Dirk Helbing. Information and material flows in complex networks [ J ]. PhysicaA, 2006,363 ( 1 ) : xi - xvi.
  • 5Christian Kuhnert, Dirk Helbing. Scaling laws in urban supply networks [ J ]. PhysicaA, 2006,363 ( 1 ) : 89 - 95.
  • 6Marco Laumanns, Erjen Lefeber. Robust optimal control of materi- al flows in demand -driven supply networks[ J]. PhysicaA, 2006, 363(1) :24 -31.
  • 7胡一弦.基于复杂网络的交通网络复杂性研究[D].复旦大学,2008,9(1):40.
  • 8朱大智,吴俊,谭跃进,邓宏钟.基于度分布的复杂网络拓扑结构的构造[J].计算机仿真,2007,24(8):130-132. 被引量:9
  • 9董明,彭颖.供应链网络设计的健壮性指标[J].上海交通大学学报,2007,41(7):1092-1096. 被引量:10
  • 10谢政.网络算法与复杂性理论[M].长沙:国防科技大学出版社,2004.

二级参考文献19

  • 1于辉,陈剑,于刚.回购契约下供应链对突发事件的协调应对[J].系统工程理论与实践,2005,25(8):38-43. 被引量:166
  • 2于辉,陈剑,于刚.批发价契约下的供应链应对突发事件[J].系统工程理论与实践,2006,26(8):33-41. 被引量:80
  • 3H Tangmunarunkit,et al.The impact of routing policy on Internet paths[C].IEEE Infocom,2001.736-742.
  • 4P Erds,A Rényi.On random graphs[J].Publ.Math.,1959,6:290-297.
  • 5K L Calvert,M B Doar,E Zegura.Modeling Internet Topology[C].IEEE Communications Magazine,1997,35(6):160-163.
  • 6E Zegura,K L Calvert,S Bhattacharjee.How to Model an Internetwork[C].IEEE Infocom,1996.594-602.
  • 7B M Waxman.Routing of Multipoint Connections[J].IEEE Journal on Selected Areas in Communications,1988,6(9):1617-1622.
  • 8M Faloutsos,P Faloutsos,C Faloutsos.On power-law relations of the Internet topology[J].Comput.Commun.Rev.,1999,29:251-262.
  • 9A L Barabási,R Albert.Emergence of scaling in random networks[J].Science,1999,286:509-512.
  • 10Gaonkar R,Viswanadham N.Robust supply chain design:A strategic approach for exception handling[C]//Proceedings of IEEE International Conference on Robotics and Automation.Taipei,Taiwan:IEEE Press,2003,9:1762-1767.

共引文献39

同被引文献110

引证文献15

二级引证文献80

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部