基于车辆限制的可重复运输路径优化研究

Vehicle Routing Research of Repetitive Transportation under Vehicle’s Number Constraints

路径优化问题过多关注行驶路程的做法,会造成多余车辆的使用,车辆的空载率过高,从而使整个运输成本过高。以车辆使用数量和行驶里程为目标,建立了各任务点允许多辆车经过的可重复运输的数学模型。在最少车辆的约束下,通过改进启发式节约算法来解决路径优化问题。最后通过算例进一步证明了该算法的可行性。

The vehicle routing problem focuses more attention on how to plan the vehicle to pass the least roads may lead to use more vehicles and lead to high idling rate, which leads to high cost of transportation. The vehicle and the mileage and constitute mathematical model of repetitive transportation are considered, which allows any mission to be finished by more than a vehicle. It solves the problem through improved C-W Algorithm at the limit of the least vehicle. In the end, the result of the example testifies the feasibility of the algorithm further.