基于有限调整的城市冷链物流配送优化

Limited Adjustment-Based Optimization of Distribution in Urban Cold Chain Logistics

摘要: 本研究基于有限调整的城市冷链物流配送路线优化问题，旨在最小化总配送距离，同时满足客户多样化的货物需求。研究问题涉及将客户分配到不同配送路线上，并确定每条路线上的配送顺序，需考虑实际约束条件，包括车辆常温和冷藏货物的容量限制、重量限制，以及时间窗约束。有限调整指强调初始路线的稳定性，对初始线路改动不宜过大。针对该问题，本文构建混合整数规划模型以描述目标和约束，并根据问题特征设计了求解方法框架。求解方法包括两部分，一是优化可行路线的配送顺序和通过节点剔除与重新插入修复不可行路线，以确保所有路线可行；二是通过取消客户节点较少且货物总重较低的路线并将其节点重新分配，优化配送路线数量，以减少车辆使用。数值实验验证了该方法的有效性，证明其能够优化配送路线。本文所提方法为冷链物流企业提升效率和适应性提供了实用工具。

Abstract: This paper investigates the limited adjustment-based urban cold chain logistics distribution route optimization problem, which aims to minimize the total distribution distance while satisfying the diverse demands of customers for goods. The research problem involves assigning customers to different distribution routes and determining the distribution sequence on each route, which requires consideration of practical constraints, including capacity limitations of vehicles for ambient and refrigerated goods, weight limitations, and time window constraints. Limited adjustment means emphasizing the stability of the initial routes, and the changes to the initial routes should not be too significant. To address the problem, this paper constructs a mixed-integer programming model to describe the objectives and constraints, and designs a solution method framework for the problem characteristics. The solution method consists of two parts: one is to optimize the distribution sequence of feasible routes and repair infeasible routes by node elimination and reinsertion to ensure that all routes are feasible; the other is to optimize the number of distribution routes by eliminating the routes with fewer customer nodes and lower total weight of goods and redistributing their nodes in order to reduce the use of vehicles. Numerical experiments verify the effectiveness of the method and prove that it can optimize distribution routes. The method proposed in this paper provides a practical tool for cold chain logistics companies to improve efficiency and adaptability.