The Study On Electric Vehicle Routing Problem With Time Windows And Release Dates

With the rapid development of e-commerce in recent years,the Internet retail market continues to attract consumers to shop online in a variety of ways.However,with the increase in online shopping by consumers,the number of express delivery orders and urban logistics distribution have also increased,uneven distribution of goods,redundant logistics distribution vehicles,low customer satisfaction,urban traffic congestion,and exhaust pollution.The phenomenon is more serious.These problems will directly affect the long-term development of a logistics enterprise.In order to solve these practical problems,logistics companies are replacing traditional fuel vehicles with electric vehicles and overall planning the transportation of goods in order to plan a logistics delivery vehicle that can obtain the highest customer satisfaction,the lowest total cost of vehicle travel,and reduce urban pollution.route.Therefore,under this background,the problem of electric vehicle routing with time windows and release dates is first proposed as the research problem of this article.The main research work and results of this paper are as follows:Firstly,the research status of vehicle routing problem,electric vehicle routing problem and vehicle routing problem with release dates are reviewed.It is found that the less release dates is considered in the vehicle routing problem,but the release dates is in the actual logistics delivery.Actually exists in the scene and will have a certain impact on logistics and distribution.Based on this,the practical and theoretical significance of the electric vehicle routing with time windows and release dates is proposed.Secondly,a 0-1 mixed integer linear programming mathematical model of the electric vehicle routing with time windows and release dates is constructed.The model takes electric vehicles as the research object,and introduces the release dates for the goods required by customers to the logistics distribution center after production and transportation and allows electric vehicles to be distributed by logistics distribution vehicles.In order to avoid the existence of deliverable time leading to the redundant driving of electric vehicle logistics distribution vehicles,this paper takes the minimum total distance of electric vehicles as the model’s optimization goal.Then,according to the characteristics of the problem studied in this paper,an adaptive large neighborhood search algorithm suitable for solving the problem is designed.In order to solve the mathematical model proposed in this paper,this paper uses the standard adaptive large neighborhood search algorithm as the theoretical framework,and improves part of the execution process and algorithm composition of the standard adaptive large neighborhood search.While adding the charging station adjustment strategy,on the basis of the original operator,the problem is further studied from the perspective of time,and the destroy and repair operators related to the vehicle travel time and delivery time are added,making the algorithm more Suitable for solving the problems raised in this article.Finally,through a large number of example experiments and analysis,it is verified that the adaptive large neighborhood search algorithm proposed in this paper is superior to the traditional adaptive large neighborhood in terms of solution quality,operator selection,optimization ability and convergence speed.Search algorithm,which proves that the adaptive large neighborhood search algorithm proposed in this paper is more effective,adaptable and stable than traditional algorithms.Then,based on the algorithm,this paper solves the problem under different delivery time in the system,and analyzes the data of the results,and finally puts forward some management enlightenment and suggestions for logistics distribution enterprises to obtain an optimal electric vehicle routing distribution scheme.