摘要
针对物流配送路径的最小化问题.根据贝尔曼最优化原理及动态规划,提出基于矩阵运算的最短路径求解法;该方法直观且不需要在计算完距离后反推最优路线.因此在供应链上有较好的应用.
Minimums of logistic distribution routing based on supply chain will be dealt with, solution of the shortest path based on matrix algorithms is brought forward which is basis of Bellman optimization theory. The examples of operation show that the method is visual and needn't backward reason optimal routing after computing distance.
出处
《哈尔滨理工大学学报》
CAS
2003年第2期122-124,共3页
Journal of Harbin University of Science and Technology
基金
哈尔滨市学科后备带头人基金资助(0171218041)
