基于PageRank算法的改进物流节点选址模型研究

Research on improved logistics node location model based on PageRank algorithm

文中针对物流网络设计中的关键物流配送节点选址问题传统算法的局限性,结合PageRank算法和贪心算法,设计了一种考虑交通拥堵情况和节点利用率的连续型多物流节点选址算法。算法将各交通小区货运需求量通过PageRank算法进行推荐排序,然后使用贪心算法和聚类算法不断迭代,获得覆盖所有需求同时满足利用率的物流节点。同时基于南京市仙林区物流数据展开实验。实验结果显示本文提出的算法相比较传统的多元节点算法,在物流节点个数方面,数量有明显减少;在服务交通小区覆盖率方面,本文提出算法覆盖率略低于多元节点法,但覆盖率均超过90%,即该算法覆盖范围利用率均能达到平均水平。综合考虑物流节点的建设及运营成本,可得出如下结论:文中提出的基于PageRank算法的连续型多物流节点覆盖算法较传统的节点选择算法高效。

In view of the limitations of traditional algorithms for the location selection of key logistics distribution nodes in the design of logistics network,combined with PageRank algorithm and greedy algorithm,this paper designs a continuous multi-logistics node location selection algorithm considering traffic congestion and node utilization. The algorithm sorts the demand of freight transportation in each community through the PageRank algorithm,then uses the greedy algorithm and clustering algorithm iteration,constantly get cover all requirements at the same time satisfy the utilization ratio of logistics nodes. Meanwhile,the experiment was carried out based on the logistics data of xianlin district,Nan Jing city. The experimental results show that the algorithm presented in this paper comparing with the traditional multi-node algorithm,in terms of the number of logistics nodes,the number is significantly reduced,in terms of service traffic community coverage,this paper proposes that the algorithm coverage rate is slightly lower than that of the multi-node method,but the coverage rate is over 90%,that is,the algorithm coverage rate can reach the average level. Comprehensive consideration of the logistics node construction and operating costs,the following conclusion can be drawn: the continuous multi-logistics node coverage algorithm based on PageRank algorithm proposed in this paper is more efficient than the traditional node selection algorithm.