车辆运输路径规划问题研究-《计算机技术与发展》

文章信息/Info

Author(s):: YU Rui; CAO Jie-nan; ZHU Pei-dong; School of Computer, National University of Defense Technology

Keywords:: vehicle transportation; open vehicle routing problem（OVRP） ; routing planning; saving algorithm

摘要:: 为了更好地解决武警车辆运输路径规划问题，提高部队行动的迅速性，在考虑武警车辆运输实际需求的基础上，文中建立了开放式车辆路径模型，增加了诸多约束条件，例如车辆容量限制、时间窗限制等等。同时，论述了节约算法的基本原理，并采用设计改进的节约算法对开放式车辆路径问题进行了求解。通过实际案例的验证，采用改进的节约算法能够得到较满意的解，既能够满足时间限制，又能够节约运输里程和费用。结果表明，此种算法简明、易于理解，且可操作性强

Abstract:: In order to better resolve the vehicle routing planning problem of armed police transportation, and increase the rapidity of military operations ,the open vehicle routing problem（OVRP） model is constituted on the base of actual request of armed police transporta- tion, which adds a good many limited conditions, such as vehicle capacity and time window restraint etc. At the same time, the basic principle of the saving algorithm is described, and this question was resolved using an improved saving algorithm. The more satisfactory answer is got through the verification of actual ease. Not only can the time limit be met, but also the transport distance and transport charge are reduced. It is shown that this arithmetic is concise ,comprehensible and operable