Research on route planning algorithms for trackless rubber wheeled vehicles with multiple constraints
Aiming at the existing problems of low efficiency and unreasonableness in trackless rubber wheeled vehicle dispatching,and considering the advantages of traditional mileage saving method,such as fast operation,convenience and flexibility,research on task op-timization and shortest path planning of coal mine trackless rubber wheeled vehicles under multiple constraints by adding constraints based on traditional conservation algorithms was investigated.By improving single-type vehicle restriction of traditional saving algorithm to multiple-type vehicle,the utilization rate of vehicles was improved and the cost of using vehicles was reduced.The time window con-straint was put forward,which improved the arrival punctuality rate of rubber-wheeled vehicles,improved the uncertainties in manual processing and dispatching operations,and caused vehicle delays,so as to avoid a series of unnecessary accidents.The restriction of car-go type was put forward,which improved the actual load rate of vehicles and the situation of"one vehicle for one use".The maximum driving mileage constraint was put forward,which improved the safety and security of rubber-wheel vehicle operation and improved the driving environment in underground.The actual calculation example of Dahaize Coal Mine in Shaanxi Province was used to test the im-proved saving algorithm.The comparison of calculation results shows that after being processed by the algorithm under multiple con-straint conditions,the average actual load rate of the vehicle reached over 90％.The on-site application results show that this scheme can improve the delivery efficiency of rubber wheel vehicles,optimize vehicle tasks,and effectively save costs to meet the on-site appli-cation needs of coal mines.
save algorithmmultiple constraintsroute planningtask optimization
万方数据
维普
