无人驾驶清扫车路径优化模型及其求解算法

Path Optimization Model and Solution Algorithm for Unmanned Sweeper

随着无人驾驶清扫车的推广使用,合理地减少额外的行驶时间是必要的.本文将无人驾驶清扫车路径问题看作是道路中间存在车场且有容量限制的弧路径问题,并建立无人驾驶清扫车路径优化模型,设计了求解该模型的模拟退火算法,对每辆车的行驶路线先后优化两次,案例分析结果显示所有车辆的行驶时间减少了50%,验证了算法的有效性.论文最后给出了车辆行驶路线图,路线图符合模型中所有约束条件,验证了模型的可靠性.

With the popularization and use of driverless sweepers, a reasonable reduction in additional travel time is necessary. In this paper, the unmanned sweeper path problem is regarded as an arc path problem with a parking lot in the middle of the road and a capacity limit, and established the path optimization model of the unmanned sweeper, and designed a simulated annealing algorithm to solve the model, the driving route of each vehicle is optimized twice, the case analysis results show that the travel time of all vehicles is reduced by 50%, which validates the effectiveness of the algorithm. At the end of the paper, the vehicle driving route map is given, and the route map conforms to all the constraints in the model, which verifies the reliability of the model.