Research On The Optimal Safety Transportation Routing Of Dregs Vehicle

Dregs vehicle safety transportation is a focus of the current society and how to reasonably plan dregs vehicle transportation path and reduce the transportation risk the roads under the premise of the economic interests of transporters is of great significance. Currently, there are relatively few theoretical researches about dregs vehicle transport route choice and most of them are about transportation route choice of dangerous goods and hazardous waste. Besides, as for the transportation risks, these researches only consider objective risks such as accident probability or the effect of the personnel density of the regional traffic; they have certain instructiveness for dregs vehicle route choice, but they do not fully apply it. In addition, because dregs vehicles run with full load, the economic interests of transporters can’t simply be measured by using the actual loading capacity in previous models. Aiming at the previous deficiencies, the paper combines the economy and safety requirements of dregs vehicle. transporters, takes the maximum economic benefits of transporters and the minimum transportation risks as the double targets, establishes the optimal safety transportation route choice model and designs algorithm, finally obtains the optimal safety transportation route. The main work and achievements of the paper are as follows.For the single starting point of single dregs vehicle, the paper considers the potential influence that dregs vehicle bring to the traffic road in transport process, gives the definition of road safety risk, and then presents the definition of arbitrary path safety risk. On the basis, the paper combines the economy and safety requirements of dregs vehicle transporters, takes the maximum economic benefits of transporters and the minimum transport risks (route safety risk) as the double targets, establishes the optimal safety transportation route choice model and designs algorithm, and discusses the model solutions under two different circumstances. For many shortest paths containing the path with the minimum safety risk that can be found in the internet, the paper designs the accurate algorithm A with time complexity beingO(n2) and solves it, where ndenotes the number of nodes; for many shortest paths can be found in the internet but the minimum safety path risk is not included in the shortest path set, the paper designs the approximate algorithm GA* with time complexity being O(n3), solves it, and analyze the approximation ratio of algorithm GA*. Finally, the paper conducts instance analysis by combining the local road network of Xi’an International Port Zone Taojia Village Processing Field and verifies the validity of the model and algorithm.For the multiple starting points of many dregs vehicles and transport at different periods of time, the paper takes the maximum economic benefits and minimum transportation risk of entire transportation fleet in individual working day as the double targets, establishes the optimal safety transportation route choice model based on k dregs vehicles, m starting points and transport at different periods of time, designs the approximate algorithm MKA with time complexity being O(fn3) and solves it, where n denotes the number of nodes and analyzes the approximation ratio of algorithm MKA*. The results show that in f periods of time, when the difference between the maximum path and the minimum path value with travel time and road safety risk as the weight is not very big, the approximation ratio tends to bel. By the local road network of Xi’an International Port Zone Taojia Village Processing Field as an example, the paper analyzes and verifies the validity of the model and algorithm.