节点文献

基于云计算求解城市物流配送最短路径研究

Reseach on Solving the Shortest Path of Urban Logistics Distribution Based on Cloud Computing

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 钮亮张宝友

【Author】 Niu Liang;Zhang Baoyou;College of Economics and Management,China Jiliang University;

【机构】 中国计量学院经济与管理学院

【摘要】 物流配送是物流的核心环节之一,配送线路的优化选择决定着配送效率和运输成本。为了求解大规模城市路网中的物流配送最短路径问题,提出了基于Map Reduce的并行算法和GIS仿真结合的求解方法。在该求解方式中,构建Map Reduce并行化模型和算法流程;数字化城市路网,借助于mapin-fo分层管理道路和配送点,并对道路和配送点进行拓扑化处理,生成MID文件供Map Reduce使用;通过Hadoop平台实现最短路径计算并在Map X直观显示出计算结果。

【Abstract】 Logistics distribution is the core link of logistics, optimization of distribution lines determines the efficiency of delivery and transportation costs. In order to solve the shortest path problem of logistics distribution in large-scale urban network, the solving method based on Map Reduce and GIS simulation is proposed.this method proposes a shortest path algorithm based on Map Reduce, constructs a parallel process model and algorithm of Map Reduce; digitalizes urban road network, manages road and distribution points according to layer with the help of Map Info, topologizes road and distribution point,generates the MID file which is used by Map Reduce; finishes the calculation of the shortest path through the Hadoop platform and displays intuitively the results in Map X.

【基金】 浙江省社科联重点课题(2014Z084);浙江省高校人文社科(RWSKZD03-201207);浙江省哲社重点研究基地和浙江省人文社科基地(SIPM3222)
  • 【文献出处】 科技通报 ,Bulletin of Science and Technology , 编辑部邮箱 ,2015年05期
  • 【分类号】TP301.6
  • 【被引频次】14
  • 【下载频次】350
节点文献中: 

本文链接的文献网络图示:

本文的引文网络