实际约束条件下多配送中心物流车辆调度优化

传统方法难以解决有时间窗等具有实际约束条件,且调度结果并非最优,提出一种基于变邻域搜索算法的多配送中心物流车辆调度优化方法。对多配送中心物流车辆调度优化问题进行分析,在分析结果的基础之上构建实际约束条件下多配送中心物流车辆调度数学模型;利用变邻域搜索算法求解物流车辆调度模型的最优解,完成实际约束条件下多配送中心物流车辆的调度优化。实验结果表明,采用所提方法进行多配送中心物流车辆调度,其总运输时间短、运输总费用低,调度结果较优,且符合实际约束。

Optimization of logistic scheduling for multi distribution centers under practical constraints

It is difficult for traditional methods to solve problems with actual constraints such as time windows, and the scheduling results are not optimal. To solve this problem, a variable neighborhood search algorithm is proposed to optimize the logistics vehicle scheduling problem of multiple distribution centers. The optimization problem of logistics vehicle scheduling in multi distribution center is analyzed. On the basis of the analysis results, the mathematical model of multi distribution center logistics vehicle scheduling under actual constraints is constructed, and the optimal solution of the logistics vehicle scheduling model is solved by using the variable neighborhood search algorithm, and the multi distribution center logistics vehicle is completed under the actual contract conditions. Scheduling optimization. The experimental results show that the proposed method of multi distribution center logistics vehicle scheduling has short total transportation time, low total transportation cost, better scheduling results and practical constraints.