Study On Optimization Of Transportation Routes For Hazardous Chemicals Based On Real-time Road Surface Information

With the rapid development of society,the use of hazardous chemicals,the variety and quantity of production are becoming more and more.It gradually becomes indispensable things for human life and production.So,the research on the path planning of hazardous chemicals transportation has become the focus of scholars at home and abroad.This article mainly uses real-time path information to plan the path of hazardous chemical vehicles in the transportation process.The primary work is as follows in the paper.Firstly,real-time path information processing.According to the real-time path status,the road service level of the relevant road segment can be obtained through the introduction of the traffic service level.And then the real-time route information can be processed.Secondly,construction of a path optimization program for hazardous chemicals transport vehicles.Before the vehicle travels,the initial route planning is performed according to the historical information of the related road sections collected.During the driving process,the service level of the road that is about to reach the next section of the planned unrouted road section is determined.When the road service level reaches the activation level,the information of the path of the changed path status is updated.The local path optimization is performed.The vehicle travels according to the new planned path.Thirdly,improved local optimization of traditional Dijkstra algorithm.When the locally optimized algorithm searches,the search stops when the currently searched shortest node exists in the node of the shortest path formed by the initial planning.the original queue can be updated with the formed local queue.This improved application instance is verified.Fourthly,a class decision tree pruning method is used for local optimization.Making full use of the information in the initial planning process of Dijkstra's algorithm,using the class decision tree pruning method to optimize the local path,to a great extent shorten the time of local optimization.The feasibility of the improvement is verified by an example.