基于节约算法的车辆调度问题优化

Optimization of Vehicle Scheduling Problem Based on C-W

本文通过对于车辆调度现状建立了单车满载车辆的分送优化模型。首先对问题进行分析,将模型各个需求点的最小需求量作为约束,以总运输路径最短为目标,来确定车辆配送路线。并以节约算法的基本原理为基础,对模型进来具体求解优化。最后给出优化后的处理方法的优缺点分析,并且对解结果进行讨论和再优化。

In this paper, the distribution optimization model of vehicle load vehicle is established. Firstly, the problem is analyzed, and the minimum demand of each demand point of the model is used as the constraint, and the route of vehicle distribution is determined by the shortest path of the total transportation path. The factors affecting the transportation path are the sum of the distribution of each demand point and the driving distance of the vehicle. Based on the analysis, the model is based on the basic principle of the saving algorithm. Finally, the advantages and disadvantages of the optimized processing method are analyzed, the results are discussed and optimized.