基于模拟退火与Dijkstra算法的复杂网状结构供应链最优化研究  

Optimization research of the complex network structure supply chain based on simulated annealing and Dijkstra algorithm.

作　　者：刘俊玮[1] 王子豪[2] 

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

出　　处：《浙江大学学报（理学版）》2014年第2期149-152,共4页Journal of Zhejiang University（Science Edition）

摘　　要：复杂网状结构供应链费用最优化已成为研究的热点问题.基于模拟退火与Dijkstra算法对复杂网状结构供应链费用的优化问题进行了研究.把全国的城市分布作为复杂网状结构,以城市间的距离和建立供应点的费用作为参数,建立数学模型,并进行数值仿真,分别以全1序列、全0序列、随机序列为初始值的选取方式进行模拟,从中确定了最优解,并给出了最优供应链网络.The optimization of the complex network structure for supply chain has become the hot issue to scholars. Based on the simulated annealing and Dijkstra algorithms, the optimization of the complex network structure for supply chain is carried out. Firstly, the distribution of nationwide city is regarded as a complex network structure. Secondly, a mathematical model is established by using the distance of all the cities and the construction costs of supply centers. Finally, the numerical simulation is carried out, respectively, values initialized with all-1＇s sequence, all-0＇s sequence and the random sequence, which improves the algorithm accuracy and success rate.

关 键 词：0-1规划 DIJKSTRA算法 模拟退火算法 复杂网状结构 供应链最优化 

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