检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张瑾[1,2] 顾剑锋[3] 马良[1] 范炳全[1]
机构地区:[1]上海理工大学管理学院,上海200093 [2]河南大学计算机与信息工程学院,河南开封475004 [3]上海电子信息职业技术学院,上海201411
出 处:《公路交通科技》2009年第4期143-147,153,共6页Journal of Highway and Transportation Research and Development
基 金:国家自然科学基金资助项目(70871081);国家高技术研究发展计划(八六三计划)资助项目(2007AA01Z478);上海市重点学科建设资助项目(S30504);河南省科技厅资助项目(072400440310)
摘 要:为了满足近年来物流运输业快速发展的需要,促进物流中转运输网络的合理化建设,研究了枢纽型物流中心的功能和选址原则,详细分析了影响枢纽型物流中心选址的各种因素,提出了基于结点带权的欧氏Steiner最优树的枢纽型物流中心选址方案。针对该方案设计了相应的智能优化算法,并进行了具体的程序实现。借助该方案不仅可以使总的运输成本最小,而且能够在无需事先确定备选点的数量和位置的情况下实现同时确定枢纽型物流中心的数量及位置的目标。最后以长三角地区枢纽型物流中心的建设问题为背景,对各种数据进行了仔细的分析比较,从中确定若干区域作为物流服务需求点集,并将各种因素的综合效用作为物流需求点的权值,对上述算法进行了有效性验证。In order to satisfy the need of the rapidly development of modern transportation and accelerate the reasonable construction of the transshipment network,the function of the junction logistic center along with the principia of its location were studied and several factors that affect its location allocation were also analyzed.Then,a location scheme of junction logistic center based on the node weighted optimal Euclidean Steiner tree was proposed and two intelligent algorithms were designed and applied for the location scheme.With the aid of this proposed location scheme,not only the total cost of transportation can be minimized but also the number and locations of the centers can be acquired without any pre-determined alternatives.Finally,a practical instance of the junction logistic centers of the Yangtze River delta area was discussed.Various data were analyzed and several regions of this area were determined to be the main service demanders.All factors that can effect the location were synthesized to be the node weight and the algorithms' validity was tested.
关 键 词:运输经济 枢纽型物流中心 加权Steiner最优树 选址问题 智能算法
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.175