摘要
目的针对中药配送“小”“散”“多”现象,解决中药配送路径优化的问题,提高中药配送效率。方法围绕中药配送最佳路径问题,对传统的Bellman-Ford算法进行了改进,解决算法的存储空间等问题。结果通过亳州地区中药配送仿真实验,改进Bellman-Ford算法,对v-1条轮降距操作,找出所有路径,验证是否存在负环路,对Bellman-Ford算法结束后再增加一轮降距检查。结论改进的Bellman-Ford算法在计算最短路径优化过程中增加了算法的存储空间,优化了配送路径,节省了配送成本,提高了中药配送效率。
Objective Aiming at the phenomenon of being“small”,“scattered”and“multiple”in distribution of traditional Chinese medicine,to improve the distribution efficiency and solve the problem of optimization of distribution path of traditional Chinese medicine.Methods The traditional Bellman-Ford algorithm was improved around the optimal routing problem of important distribution,and the storage space of the algorithm was solved.Results The simulation experiment in the distribution of traditional Chinese medicine in Bozhou area,and the improved Bellman-Ford algorithm for the v-1 round-off operation were conducted to find all the paths and verify whether there is a negative loop.A round of clearance inspection was increased after the Bellman-Ford algorithm operation to improve the efficiency of distribution.Conclusion The improved Bellman-Ford algorithm has good efficiency in calculating the shortest path optimization process,and it also increases the storage space of the algorithm to optimize the distribution path and save the distribution cost.It is of great significance to the path optimization of Chinese medicine distribution.
作者
曹岩
马健
CAO Yan;MA Jian(Department of Information Engineering,Bozhou Vocational and Technical College,Bozhou,Anhui 236800,China)
出处
《河北北方学院学报（自然科学版）》
2020年第3期18-21,共4页
Journal of Hebei North University:Natural Science Edition
基金
安徽省教育厅自然科学重点基金项目:“大数据环境下中药材销售数据处理方法与市场预测研究与应用”(KJ2018A0887)。
