摘要
针对冷链-常温货物混合配送问题,建立了以总配送成本最小为目标的车辆路径优化模型,模型综合考虑了区域客户拥挤度,多车型,多服务时间窗的现实情况.提出了带有两种邻居解评价机制的禁忌搜索算法对问题进行求解,机制1综合解的各个指标为其设置了一个目标值向量,机制2则在目标值向量上增加了一个惩罚目标值.实验结果表明,禁忌搜索+机制2的优化效果最好,冷链混合配送模式能有效降低配送总成本.提出的模型和算法对于电商企业构建更低成本更高质量的新型冷链混合配送网络有一定指导作用.
This paper focuses on a new mixed distribution problem of cold-chain and normal-temperature products.In this problem,customers with multiple time windows in different congested areas are served by refrigerated and non-refrigerated vehicles.The goal is to minimize the total cost of distribution.A tabu search heuristic algorithm with two neighbor evaluation rules is proposed to solve the problem.Thefirst evaluation rule considers an objective vector composed of several attributes of the solution,while the second one considers a penalty cost in addition to the objective vector.Computational experiments indicate that the tabu search algorithm with the second evaluation rule performs better than other proposed approaches,and cold chain mixed distribution mode can effectively reduce the total distribution cost.The proposed model and algorithm can help e-commerce enterprises build a new cold chain mixed distribution network with lower cost and higher quality.
作者
邓发珩
梁卓斌
秦虎
王恺
Deng Faheng;Liang Zhuobin;Qin Hu;Wang Kai(School of Management,Huazhong University of Science and Technology,Wuhan 430074,China;College of Civil and Transportation Engineering,Shenzhen University,Shenzhen 518060,China;Economics and Management School,Wuhan University,Wuhan 430074,China)
出处
《系统工程学报》
CSCD
北大核心
2024年第2期258-271,共14页
Journal of Systems Engineering
基金
国家自然科学基金资助项目(71821001,71971090,72171179).
关键词
混合配送
车辆路径问题
禁忌搜索
多车型
多时间窗
mixed distribution
vehicle routing problem
tabu search
multi-typefleet vehicles
multi-time windows
