| In the transportation of perishable fresh food,reasonable cold chain distribution path planning can save a lot of costs for enterprises,and the use of new energy vehicles is of great significance to the call for national energy conservation and emission reduction.However,the research theories of the two fields are not mature yet,and the cross research of cold chain logistics and new energy refrigerated vehicle is even rare.This thesis mainly studies the path planning of new energy refrigerated vehicle with perishable food as its distribution object Considering the difference between new energy refrigerated trucks and traditional refrigerated trucks and the characteristics of perishable foods,the path cost of distributing fragile foods in new energy refrigerated trucks is analyzed.A problem model that includes fixed costs,driving costs,damage costs,and time window penalty costs,as well as vehicle service constraints,load constraints,power constraints,and time constraints is constructed Then,the GWO algorithm with strong global search ability,good optimization effect and few artificial parameters is selected to solve the model.However,the original GWO algorithm does not perform well when faced with the path problem,and corresponding adjustments need to be made to ensure the acquisition of the optimal path.Therefore,a S-GWO algorithm is proposed to solve the model established in this thesis.In addition,in order to solve the impact of the actual network on the subsequent solution,the shortest path algorithm is adopted to process the incomplete graph.But the traditional algorithms have a long running time and cannot complete data processing in time when faced with real-time updated information.In this thesis,the SDM algorithm is designed and upgraded to improve the running speed of the algorithm while ensuring the accuracy of the results.Finally,this thesis uses the established model and algorithm to simulate and solve 100 Yonghui supermarket stores and 2 Yonghui distribution centers in Chongqing.Simulation test results of network graph show that compared with Floyd algorithm,the SDM algorithm in parallel mode can quickly and accurately convert the incomplete graphs in the actual network into complete graphs.Simulation results show that the S-GWO algorithm can obtain the stable optimal solution through a finite number of iterations,and it is better than the original GWO algorithm in iteration performance,searching performance and algorithm accuracy. |
