遭受随机性破坏的供应链网络优化研究  

Optimization research of complex supply chain network subjected to random destruction

作　　者：刘俊玮[1] 刘晓楠[1] 王子豪[2] 韩邦合[1] 

机构地区：[1]西安电子科技大学数学与统计学院,陕西西安710126 [2]西安电子科技大学软件学院,陕西西安710126

出　　处：《浙江大学学报（理学版）》2014年第3期294-298,共5页Journal of Zhejiang University（Science Edition）

摘　　要：探讨供应链网络中供应方与链路破坏方在确定性可破坏链路遭受随机性破坏情况下双方的博弈.首先建立Dijkstra算法和模拟退火算法模型,把中国城市分布作为复杂网状结构,对复杂网状结构供应链问题进行了优化研究.然后在链路遭受有限破坏情况下,通过优化供求关系,使被破坏方损失降到最小.并研究了在确定性可破坏链路遭受随机性有限破坏时,破坏策略方与供应链方通过调整新的最优化路径,使博弈双方处于最优状态的方法.The game problem is studied when the deterministic can disrupt link under the random failure cases. First we establish a model based on Dijkstra algorithm and simulated annealing algorithm, the distribution of eit ies in China as a complex network structure, optimize the problem of complex supply chain network structure. Then in link damage cases, by optimizing the supply point of supply and demand, the loss of damaged party is minimized. Research in deterministic can disrupt link under the condition of stochastic damage, destroy the strategy adjustment of new optimization path with supply chain strategy, make the game both sides strive to in the optimal state.

关 键 词：供应链网络 随机性破坏 DIJKSTRA算法 模拟退火算法 优化 

分 类 号：O29[理学—应用数学]