基于电势的最优加权Steiner树蚂蚁算法及其选址应用  

Ant algorithm for optimal weighted Steiner tree and its application in location allocation based on the concept of electronic potential

作　　者：张瑾[1] 单贵[2] 马良[1] 

机构地区：[1]上海理工大学管理学院,上海200093 [2]上海电子信息职业技术学院计算机应用系,上海201411

出　　处：《上海理工大学学报》2009年第3期283-285,289,共4页Journal of University of Shanghai For Science and Technology

基　　金：国家自然科学基金资助项目(70871081);国家“863”高技术研究发展计划资助项目(2007AA01Z478);上海市重点学科建设资助项目(S30504);河南省科技厅资助项目(072400440310)

摘　　要：在传统欧氏Steiner树的基础上,提出加权Steiner最优树模型,适用于求解必须考虑结点权值情况下的最短路问题.借用电场理论中电势的概念给出了模型的蚂蚁算法实现,并以某大型电子商务企业物流中心选址问题为例,验证了模型的实用性及算法的有效性.Based on the traditional Euclidean Steiner minimum tree,a model of weighted Steiner minimum tree was presented, which is very useful in finding the shortest route in the case that the weights of the nodes should be considered. In the light of the concept of electronic potential, an ant colony algorithm was proposed, which was implemented and tested through practical instances of the location allocation of logistic center of a large E-commerce company. Experiments show the validity of the model and the effectiveness of the algorithm.

关 键 词：加权Steiner最优树 物流 选址 蚂蚁算法 电势 

分 类 号：TP301[自动化与计算机技术—计算机系统结构] F252[自动化与计算机技术—计算机科学与技术]