Font Size: a A A

Research On Routing Optimization Problem Of Urban Logistics Distribution Based On Mobile Battery Swapping Mode

Posted on:2024-02-28Degree:MasterType:Thesis
Country:ChinaCandidate:D XuFull Text:PDF
GTID:2542307157470264Subject:Transportation
Abstract/Summary:PDF Full Text Request
With the rapid growth of global e-commerce,the scale of logistics industry has shown explosive growth.Urban logistics,as an important branch of the logistics industry,has led to the improvement of the national economy and quality of life.The implementation of the "double carbon" target has posed a new challenge to urban logistics distribution,requiring companies to reduce carbon emissions while cutting distribution costs.The emergence of electric vehicles has significantly reduced the carbon emissions of vehicles and has been used in urban logistics and distribution on a certain scale.Nevertheless,electric vehicles still have limited range and long charging times.In order to meet these challenges,the electric vehicle power exchange model has emerged,which is expected to replace the traditional charging method and has received widespread attention.Based on the above background,this paper firstly reviews the research on related issues at home and abroad to provide a basis for the development of mobile power exchange mode.Secondly,the paper establishes an urban logistics distribution path optimization model based on mobile power exchange mode,which establishes an urban logistics distribution routing optimization model with the objective of minimizing the total cost of distribution,taking into account the constraints of time window,number of vehicles and spatio-temporal synchronization of logistics distribution vehicles and mobile battery swapping vehicles.And test the accuracy of the model with the Gurobi solver.Finally,an adaptive large-neighborhood search algorithm is designed to meet the characteristics of this model,and Matlab is used to solve the model.The effectiveness of the algorithm was tested by solving Small-medium and large-scale cases from the Solomon dataset.The average solution time of the algorithm in the large-scale case is 217.32 s and the average deviation is 0.90%,which shows the superiority of the algorithm.The research results show that the adaptive large neighborhood search algorithm designed for the model constructed in this paper performs well in three aspects: solution speed,accuracy and stability.By comparing the urban logistics distribution path optimization problem based on mobile charging mode,it is concluded that the urban logistics distribution path optimization model based on mobile power exchange mode can save about 12.50% of the distribution cost and improve the logistics distribution efficiency.In addition,by conducting sensitivity analysis on the range of logistics distribution vehicles and the maximum load capacity of mobile power exchange vehicles.The results show that the longer the battery range of the logistics distribution vehicle,the lower the total cost of distribution,and the less the reliance on the mobile replacement trolley.The larger the maximum load capacity of the mobile battery swapping vehicles,the lower the total cost of distribution,and the highest it can save about 10% of the distribution cost.Therefore,the mathematical model and the algorithm designed in this paper can provide a reliable theoretical basis for the optimization of urban distribution paths in the battery swapping electric mode which is of great practical significance.
Keywords/Search Tags:Urban logistics distribution, Vehicle routing problem, Mobile battery swapping electric mode, Adaptive Large Neighborhood Search
PDF Full Text Request
Related items