期刊论文

中文

系统工程

1001-4098

2015

33

11

53-59

国家自然科学基金资助项目(61170017)

本校为第一机构

通过Floyd算法求出快递网络节点间的最短路径长度和需要中转的次数,根据节点间的最短路径和需要中转的次数算出配送时间;通过Dijkstra算法对边介数、节点介数进行加权求和得出快递网络边的货物流量和节点的货物中转量,根据运费率、边的货物流量和边的长度算出边的运输成本,根据节点货物中转量算出中转费用和存储费用;以快递网络总配送成本最小化为优化目标,构建带有配送时间约束和节点最大流量约束的快递网络优化模型,并设计从全连通网络逐渐删除网络边至总配送成本最小为止的算法进行求解,最后通过算例验证了模型和算法的有效性。

In this paper, we find the length of the shortest path and the number of transit nodes by the Floyd algorithm. Firstly we find the goods flow of lines and the transfer goods of nodes through weighted sum of edge betweenness and node hetweenness by the Dijkstra algorithm through calculating the delivery time and transit time based on the shortest path. We calculate the transport cost according to freight rates and the flow of goods and the length of the edge and the transfer cost and storage cost according to the transfer goods of nodes. Taking the total cost as the optimization goal, we build ...