摘要
针对传统单一的物流配送模式已经难以满足互联网电商低成本物流配送需求的现状,本文通过综合考虑运输路线中的距离、费用、时间等多个因素,建立一个多目标的TSP优化模型,并利用模拟退火算法进行求解,以求得一个合理分配人力、物力、财力的最佳方案。实验结果表明:经过算法优化后的路径距离能更好的收敛于最优解,说明该算法是一种解决物流配送路径选择的有效算法。
The traditional single logistics distribution model fails to meet the demand of the low-cost logistics distribution of the Internet. By considering many factors such as distance, cost and time in the transportation route, a multi-objective TSP optimization model is established. And the simulated annealing algorithm is used to solve the optimal solution of a reasonable allocation of human, material and financial resources. The experimental results show that the path distance after algorithm optimization converges better to the optimal solution, which indicates that the algorithm is effective in solving the logistics distribution routing problem.
作者
姚壹壹
王玲鹏
金科扬
汪保
YAO Yiyi;WANG Linpeng;JIN Keyang;WANG Bao(Ningbo University of Technology, Ningbo, Zhejiang, 315211, China)
出处
《宁波工程学院学报》
2018年第1期39-44,共6页
Journal of Ningbo University of Technology
关键词
物流配送
路径优化
TSP问题
模拟退火
logistics distribution, route optimization, traveling salesman problem, simulated annealing