运钞车车辆路径规划策略

摘要

针对实际运钞网点数每天动态变化问题,提出一种先划分、再优化的动态运钞车路线规划策略.第一阶段先采用Dijkstra算法求出两点之间的最短路径,再利用最近邻算法和均衡工作量因子求出动态需求车辆的车辆数和每条路径上的网点;第二阶段利用前置交叉的改进遗传算法,分别优化每条路径并求出每条路径上的网点顺序,获得距离最短和时间最少的路径.实验结果表明,该策略能有效解决车辆数目和路径根据需求动态变化的问题,达到节约和合理利用资源的目的.%Since the real node number in cash transport network changes dynamically, a route planning strategy for dynamic cash transport routing was proposed.The strategy did partitioning and optimizing in sequence.Firstly, Dijkstra algorithm was adopted to compute the shortest route between two nodes, and then vehicle number and node on each route were gotten by nearest neighbor algorithm and workload balancing factor.Secondly, the pre-cross genetic algorithm was adopted to optimize each route and get node sequence on the route, which could get the route with shortest distance and minimum time consumption.The experimental results show that the proposed strategy can meet the requirements of dynamic vehicle number and route, and achieve the purpose of saving resources.