首页 | 本学科首页   官方微博 | 高级检索  
     

基于最小生成树法的物流结点选址和线路优化模型研究
引用本文:田晟. 基于最小生成树法的物流结点选址和线路优化模型研究[J]. 交通标准化, 2009, 0(9): 135-138
作者姓名:田晟
作者单位:华南理工大学土木与交通学院,广东广州510640
摘    要:在物流研究中,经常要涉及物流结点选址和线路优化问题。在选址模型中,一般采用直线和折线两种方法来计算结点间的距离。在分析重心法基础上,指出该方法存在一定的不合理性,并提出基于最小生成树法的物流结点选址和线路优化模型,其算法比较表明,两个模型各有特色,通过VB编程运行程序可得出最小费用值,实现了物流网络间结点的优化问题。

关 键 词:物流  最小生成树法  避圈法  直线简化法

Logistics Node Location and Route Optimization Based on Minimum Spanning Tree
TIAN Sheng. Logistics Node Location and Route Optimization Based on Minimum Spanning Tree[J]. Communications Standardization, 2009, 0(9): 135-138
Authors:TIAN Sheng
Affiliation:School of Civil Engineering and Transportation;South China University of Technology;Guangzhou 510640;China
Abstract:Logistics node location and route optimization is usually studied in logistics research.In general,the distance between two nodes is calculated by beeline or polygonal line about location model.On the basis of gravity model approach,some irrationalities are pointed out,so are the logistics node location and route optimization based on minimum spanning tree.The comparison of algorithms shows that each model has its own characteristics.The minimum cost is obtained through VB program so as to optimize the logi...
Keywords:logistics  minimum spanning tree  preventing loop rule  beeline predigestion  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号