基于时空距离聚类的冷链物流路径优化研究

The Optimization Research of Cold Chain Logistics Routing Problem Considering Spatiotemporal Distance

冷藏冷冻类产品具有易腐性、时效性等特点,使得冷链运输需要更大的资金投入,合理规划配送路径是降低成本的重要方式。基于此研究了具有多配送中心的冷链物流运输问题,在考虑时空距离的基础上,构建了以综合成本最小化为目标函数的路径优化模型,并设计一种两阶段算法进行求解。第一阶段基于时空距离度量对客户点进行聚类处理,并采用CW算法构造初始解,第二阶段采用改进的模拟退火算法进行初始解优化。计算结果表明,与不考虑时空距离以及传统模拟退火算法相比,该算法能够获得配送成本更低的解。

Cold chain products are perishable and time-sensitive,which makes cold chain transportation require greater cost consumption.So reasonable planning of distribution routes is an important way to reduce costs.Based on this,the cold chain logistics transportation with multiple distribution centers is studied,and a path optimization model with integrated cost minimization as the objective function is constructed.A two-stage algorithm is designed to solve the problem.In the first stage,the customer points are clustered based on spatiotemporal distance,and CW algorithm is used to construct the initial solution.In the second stage,an improved simulated annealing algorithm was used to optimize the initial solution.The result shows that the algorithm is able to obtain solutions with lower distribution cost compared to the traditional simulated annealing algorithm and without considering the spatiotemporal distance.