Study On Delivery Vehicle Routing Problem With Hard Time Window

Since the emergence of online takeout ordering in 2010,the proportion of fast food takeout in the catering industry has gradually increased,becoming a new development force in the catering industry.After the market competition in different stages such as germination,development and expansion,fast food takeout is entering a relatively stable mature period,and the competition among enterprises has changed from the initial competition of "subsidizing users" to the competition of improving service level and reducing cost.Delivery is an important factor that affects the service level,quality and cost of fast food takeout.More enterprises begin to pay attention to the optimization of delivery service.Perfect distribution system,reasonable distribution path and efficient distribution efficiency are important factors to improve the quality of distribution service,improve customer satisfaction and reduce distribution cost.At present,the delivery field of take-out mainly includes third-party professional delivery,shop-owned delivery and crowdsourcing delivery.This paper takes the self-run distribution as the entry point,starting from the actual scenario,to study the status quo and shortcomings of take-out delivery.Refining take-away,distribution characteristic and the constructed aiming at total shortest path of delivery with hard time Windows constraint mathematical model of distribution vehicle routing problem,and design the backward path planning and path planning under the two different ideas of priority algorithm for solving the mathematical model,the effectiveness of the algorithm is verified by practical example.Finally,in order to further study the advantages and disadvantages of the algorithm,a calculation example of take-out order distribution problem in different scenarios is designed.MATLAB is used to check the solution of the two algorithms in different calculation cases,the advantages and disadvantages of the two algorithms in different calculation cases are compared,and the reasons are further analyzed to obtain the different application scope of the two algorithms.In order to reduce the delivery cost and improve the delivery quality,provide theoretical support.