Research On Vehicle Routing Problem With Low Fuel Consumption Based On Simulated Annealing Algorithm

With the prevalence of e-commerce,online shopping has driven the development of the logistics industry,making the energy demand of the logistics industry increasing.The large consumption of energy has also led to an increase in carbon emissions,which has caused tremendous pressure on the environment.Therefore,energy conservation and emission reduction has become a hot spot in the field of logistics research.By scientifically and rationally arranging vehicles and planning the least energy consumption route,logistics enterprises can not only greatly reduce the distribution cost of enterprises,but also actively respond to the call for national energy conservation and emission reduction.Therefore,it is very practical to study the problem of low fuel consumption vehicle routing..Firstly,by analyzing the current research status of vehicle routing problems,the research problems of this paper are determined.Combined with the dynamic load fuel consumption model,the multi-vehicle vehicle routing problem and the multi-vehicle vehicle path with the fixed starting cost and the fuel consumption cost are optimized.Then,the commonly used algorithms for solving vehicle problems are summarized.The advantages and disadvantages of various algorithms are compared and analyzed.The algorithm used in this paper is determined as simulated annealing algorithm.And the three neighborhood search algorithms are combined to generate new solutions on the traditional algorithm.The designed hybrid simulated annealing algorithm not only increases the understanding of the diversity of spatial solutions,but also avoids the prematurely falling into the local optimal solution,and also mitigates the cooling rate.When the algorithm is too fast,the algorithm cannot obtain the optimal solution,so that the algorithm can find the optimal solution of the problem in a short time.Aiming at the characteristics of multi-vehicle vehicle routing problem,a multi-vehicle vehicle routing problem is transformed into multiple single-vehicle vehicle routing problems by geometric clustering algorithm,which greatly simplifies the solution process of multi-vehicle vehicle routing problem.Finally,compared with other heuristic algorithms,the comparison results show that the proposed algorithm outperforms other algorithms in both quality and speed.The results sought can not only help enterprises reduce distribution costs,but also reduce the carbon emissions of vehicles during transportation,and actively respond to the call for national energy conservation and emission reduction.