基于改进节约算法的集送货车辆路径优化

Studies of VRPSDP Based on the Improved C-W Saving Algorithms

针对集送货车辆路径优化问题研究了对C-W节约算法的改进。提出了以集货量和送货量共同作为车辆载重量的约束条件,把时间窗约束转化为里程约束,用里程数来控制客户点的归并、插入和时间窗约束的计算,建立了数学模型,实现了多个目标、约束(里程、带集送货、载重量和时间窗)的路径优化;算法通过实例验证,获得了较好的优化结果。

The improved C-W saving algorithms are studied based on the vehicle routing scheduling problem with simultaneous delivery and pickup in logistics. It is put forward that the both delivery and pickup amount are taken as the vehicle loading constraint, the time constraints are converted into mileage constraints, and the mileage is used to control customer point merge, insertion, and the time calculation. The mathematical model is set up and the path optimization under the multiple targets and constraints（mileage, simultaneous delivery and pickup, time constraints） is realized. The study cases are implemented based on the algorithms, and the better optimization results are obtained.