[1]方伟华.基于A＊算法和图遍历的烟草物流VRP的研究[J].计算机技术与发展,2011,(12):63-65.
　FANG Wei-hua.Research on Tobacco Logistics VRP Based on A ＊ Algorithm and Graph Traversal[J].,2011,(12):63-65.
点击复制

基于A＊算法和图遍历的烟草物流VRP的研究()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
期数:
2011年12期
页码:
63-65
栏目:
智能、算法、系统工程
出版日期:
1900-01-01

文章信息/Info

Title:
Research on Tobacco Logistics VRP Based on A ＊ Algorithm and Graph Traversal
文章编号:
1673-629X（2011）12-0063-03
作者:
方伟华
浙江理工大学信息电子学院
Author(s):
FANG Wei-hua
Institute of Information and Electric s, Zhejiang University of Science ＆ Technology
关键词:
A＊算法; 图的遍历; 路径优化; 物流调度; 车辆路线问题
Keywords:
A ＊ algorithm;  graph traversal ; path optimization ; logistics dispatch;  VRP
分类号:
TP302
文献标志码:
A
摘要:
同发达国家相比，我国的物流成本明显偏高，因此如何在日益激烈的竞争环境下，降低自己的物流成本，成为了众多企业关注的焦点。以烟草行业物流为基础，积极探索降低物流成本的方法。通过对烟草物流过程中的核心环节烟草配送的研究，在配送最优路径搜索过程中，采用A＊算法，并在此基础上结合图的遍历进行物流调度优化，可以快速有效地找到配送的最优路径，从而大大地降低了烟草配送的成本。通过福建中烟项目的实行，也很好地证明了这一点
Abstract:
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 ＊algorithrn 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

相似文献/References:

[1]郑延斌 李新源 段德全.一种保持Agent团队队形的路径规划方法[J].计算机技术与发展,2009,(07):159.
　ZHENG Yan-bin,LI Xin-yuan,DUAN De-quan.A Path Planning Algorithm with Agent Team Formation Maintained[J].,2009,(12):159.
[2]冯晓辉 马光思.数码谜题求解的算法设计及其扩展研究[J].计算机技术与发展,2009,(08):110.
　FENG Xiao-hui,MA Guang-si.Algorithm Design and Extension Research of N - Puzzle Problem[J].,2009,(12):110.
[3]李培 何中市.基于ArcGIS和GPS的水电气管理系统设计与实现[J].计算机技术与发展,2009,(01):172.
　LI Pei,HE Zhong-shi.Design and Implementation Water, Electricity and Gas Management System Based on ArcGIS and GPS[J].,2009,(12):172.
[4]朱永红 张燕平.用VC＋＋实现基于A＊算法的八数码问题[J].计算机技术与发展,2006,(09):32.
　ZHU Yong-hong,ZHANG Yan-ping.Programming for Eight - Figure Puzzle Problem Based on Algorithm A ＊ with Visual C ＋ ＋[J].,2006,(12):32.
[5]陈益富 卢潇 丁豪杰.对Dijkstra算法的优化策略研究[J].计算机技术与发展,2006,(09):73.
　CHEN Yi-fu,LU Xiao,DING Hao-jie.Optimized Strategy Research over Algorithm of Dijkstra[J].,2006,(12):73.
[6]刘钰 陆建峰 蔡海舟.基于改进A＊算法的机器人路径规划方法研究[J].计算机技术与发展,2012,(12):108.
　LIU Yu,LU Jian-feng,CAI Hai-zhou.Research on Path Planning Method of Robot Based on Improved A ＊ Algorithm[J].,2012,(12):108.
[7]马静,王佳斌,张雪. A*算法在无人车路径规划中的应用[J].计算机技术与发展,2016,26(11):153.
　MA Jing,WANG Jia-bin,ZHANG Xue. Application of A* Algorithm in Unmanned Vehicle Path Planning[J].,2016,26(12):153.
[8]朱云虹,袁一.基于改进A*算法的最优路径搜索[J].计算机技术与发展,2018,28(04):55.[doi:10.3969/ j. issn.1673-629X.2018.04.012]
　ZHU Yun-hong,YUAN Yi.Optimal Path Search Based on Improved A* Algorithm[J].,2018,28(12):55.[doi:10.3969/ j. issn.1673-629X.2018.04.012]
[9]程 杰,陈姚节.基于正六边形建模的无人水面艇路径规划[J].计算机技术与发展,2020,30(11):37.[doi:10. 3969 / j. issn. 1673-629X. 2020. 11. 007]
　CHENG Jie,CHEN Yao-jie.Path Planning of Unmanned Surface Vehicle Based on Regular Hexagon Modeling[J].,2020,30(12):37.[doi:10. 3969 / j. issn. 1673-629X. 2020. 11. 007]
[10]叶小艳,钟华钧,邓可儿.一种基于改进 A*算法的室内导航路径规划方法[J].计算机技术与发展,2022,32(02):202.[doi:10. 3969 / j. issn. 1673-629X. 2022. 02. 033]
　YE Xiao-yan,ZHONG Hua-jun,DENG Ke-er.A Path Planning Method of Indoor Navigation Based on Improved A-Star Algorithm[J].,2022,32(12):202.[doi:10. 3969 / j. issn. 1673-629X. 2022. 02. 033]

备注/Memo

备注/Memo:
“863”重点项目（2008AA042304）方伟华（1985-），男，硕士研究生，研究方向为计算机应用技术
更新日期/Last Update: 1900-01-01