摘要
本文针对物流配送中心运营过程中如何合理制定配送线路的问题,以邻接矩阵为基础,通过对邻接矩阵进行运算得到有向图的可达矩阵,并据此判断是否能够找到从源节点到目标节点的有向通路,最后完成最短路径的搜索。
In this paper, for the problem how to develop reasonable distribution lines in the process of logistics and distribution center operations, based on adjacency matrix, by the computation of adjacency matrix to get graph reachability matrix and judge whether can find forward path from the source node to goal node, and finally complete the search of the shortest path.
出处
《价值工程》
2013年第10期163-164,共2页
Value Engineering
基金
"基于矩阵算法的物流配送管理系统"吉教科合字[2011]第355号
关键词
车辆路径问题
配送
物流
最短路径
vehicle routing problem
distribution
logistics
shortest path
