首页> 中文期刊> 《计算机技术与发展》 >基于A*算法和图遍历的烟草物流VRP的研究

基于A*算法和图遍历的烟草物流VRP的研究

         

摘要

同发达国家相比,我国的物流成本明显偏高,因此如何在日益激烈的竞争环境下,降低自己的物流成本,成为了众多企业关注的焦点.以烟草行业物流为基础,积极探索降低物流成本的方法.通过对烟草物流过程中的核心环节烟草配送的研究,在配送最优路径搜索过程中,采用A*算法,并在此基础上结合图的遍历进行物流调度优化,可以快速有效地找到配送的最优路径,从而大大地降低了烟草配送的成本.通过福建中烟项目的实行,也很好地证明了这一点.%Compared with the developed countries,China's logistics cost is higher obviously. So,in the increasingly fierce competition environment ,many enterprises focus on how to low their own logistics costs. Based on the tobacco industry logistics,it tries actively to find a method to reduce the logistics cost. Based on the research on the core tache of the tobacco distribution, it adopts A * algorithm and graph traversal in distribution optimal path search process,can quickly and effectively find the optimal distribution path,and also greatly reduced tobacco distribution costs. Through the practice of Fujian Zhongyan project,it also well proved this point.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号