基于场景动态度的两级配送路径问题

Two-echelon distribution routing problem based on scenes dynamic degree

针对城市配送过程中出现的交通限行和需求不确定性等问题,将配送周期划分为初始配送阶段和动态补货阶段,路径中包含枢纽型物流中心、配送型物流中心和客户,研究其共同构成的两级车辆配送路径优化问题.考虑到问题的动态性,提出前摄性需求配额策略及响应性补货策略,构建基于场景动态度的两级动态车辆路径问题数学模型.设计融合扫描算子的禁忌搜索算法,完成车辆初始阶段的配送路径优化;根据场景动态度,设计修复/更新性动态客户的响应策略,快速响应动态需求.最后,通过仿真算例验证模型和算法的有效性,实验结果表明,所提出的设计策略能够有效降低动态客户对低动态度应用场景初始路径的干扰,并简化高动态度场景下的路径优化复杂度.

Aiming at the problems such as traffic limitation and demand uncertainty in the process of city distribution,this paper divides the distribution process into initial stage and dynamic replenishment stage,and studies the optimization of the two-echelon dynamic vehicle routing of the hub logistics center,the distribution logistics center and customers.Taking into account the dynamic events,this paper proposes a proactive demand quota strategy and a responsive replenishment strategy,and establishes the mathematical model of the two-echelon dynamic vehicle routing problem in dynamic circumstance.A tabu search algorithm based on a fusion scan operator is designed to optimize the delivery route in the initial stage.Meanwhile,according to the scene dynamic degree,this paper raises a repair/update dynamic customer response strategy to respond quickly to the dynamic demand.Finally,a simulation example is given to illustrate,the effectiveness of the proposed model and algorithm.The experimental results demonstrate that the proposed scheduling strategy can effectively reduce the dynamic client interference on the initial path of low-dynamism scenario and simplify the path optimization complexity of high-dynamism scenarios.