检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:姚壹壹 王玲鹏 金科扬 汪保[1] YAO Yiyi;WANG Linpeng;JIN Keyang;WANG Bao(Ningbo University of Technology, Ningbo, Zhejiang, 315211, China)
机构地区:[1]宁波工程学院,浙江宁波315211
出 处:《宁波工程学院学报》2018年第1期39-44,共6页Journal of Ningbo University of Technology
摘 要:针对传统单一的物流配送模式已经难以满足互联网电商低成本物流配送需求的现状,本文通过综合考虑运输路线中的距离、费用、时间等多个因素,建立一个多目标的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.
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229