Research On The Route Selection Of Detachable Complete Sets Of Emergency Equipment Distribution Vehicles

The study of vehicle path selection for distribution of complete sets of emergency equipment after a sudden disaster has important theoretical significance and practical value.In this paper,we consider that the distribution center has multiple sets of emergency equipment,each set of emergency equipment consists of two components,the number of vehicles in the distribution center is insufficient,the total number of sets of emergency equipment loaded on the vehicles cannot meet the total demand of the disaster site,and the goal is to study the path selection problem of the distribution vehicles of detachable sets of emergency equipment with the minimum sum of the total loss cost of missing goods and vehicle driving cost of the disaster site.The main work is as follows.The route selection for distribution vehicles of complete sets of emergency equipment under a single distribution center.Considering that the distribution center has multiple sets of emergency equipment under a single distribution center,each set of equipment consists of two components,the number of vehicles in the distribution center is insufficient,the total number of sets of emergency equipment loaded by vehicles cannot meet the total demand of the affected site,and the sum of the total loss cost of missing goods and the vehicle driving cost of the affected site is the minimum,the path selection model for the distribution vehicles of detachable complete sets of emergency equipment under a single distribution center is constructed.Two algorithms are designed to solve for two loading schemes:complete loading set of equipment and split loading set of equipment.When the complete set of emergency equipment is complete loading,the time complexity of the algorithm CSLA-SDC(Complete Set Loading Algorithm for Single Distribution Center)is proved to beO(n~2),when the complete sets of emergency equipment is split loading,the time complexity of the algorithm SLA-SDC(Splitting and Loading Algorithm for Single Distribution Center)is proved to beO(n~2).Finally,the actual distribution of complete sets of emergency equipment in the earthquake-stricken area of Luzhou,Sichuan,is used as an example to verify the effectiveness of the model and the algorithm,the approximation ratio of algorithm CSLA-SDC is 1.51 and that of algorithm SLA-SDC is 1.16,indicating that algorithm SLA-SDC has better results in solving this example.The route selection of the distribution vehicles of the complete sets of emergency equipment that can be split under m distribution centers.Considering that there are multiple complete sets of emergency equipment in each distribution center,each set of equipment consists of two parts,the number of vehicles in the distribution center is insufficient,and the total number of complete sets of emergency equipment loaded on the vehicle cannot meet the total demand of the disaster site,and the sum of the total loss cost of missing goods and the vehicle driving cost of the disaster site is the minimum,the vehicle route selection model for the distribution of detachable complete sets of emergency equipment under m distribution center is constructed.Two algorithms are designed to solve for two loading schemes:complete sets of equipment complete loading and split loading.When the complete sets of emergency equipment is complete loading,the time complexity of the algorithm CSLA-MDC(Complete Set Loading Algorithm for M Distribution Centers)is proved to be O((m+n)~2);when the complete sets of emergency equipment is split loading,the time complexity of the algorithm SLA-MDC(Splitting and Loading Algorithm for M Distribution Centers)is proved to be O((m+n)~2).Finally,the actual distribution of complete sets of emergency equipment in the earthquake-stricken area of Luzhou,Sichuan,is used as an example to verify the effectiveness of the model and the algorithm,the approximation ratio of algorithm CSLA-MDC is 1.50 and that of algorithm SLA-MDC is 1.13,indicating that algorithm SLA-MDC has better results in solving this example.