Research On Vehicle Routing Optimization Problem Of H-logistics Company

With the rapid development of internet and information technology and the popularization of internet,e-commerce is affecting people’s life more and more deeply.The transportation under e-commerce model has characteristics of numerous service customers,wide geographical distribution,and high timeliness requirement.Different types of e-commerce transportation companies have different customer locations,delivery volumes,delivery frequencies,and time requirements,and have different warehouses resources and truck resources,different optimization goals.To reduce transportation costs and improve customer service quality,it has high research significance and practical value for an e-commerce transportation company to use the existing available logistics resources and plan vehicle routing and meet customer needs and establish an efficient vehicle scheduling system according to the company’s goals.Firstly,this thesis selects the logistics service enterprise H-logistics company as the research object,adopts the method of theoretical analysis,and expounds the relevant theories of the vehicle routing problem,including the classification,solution method and research status of the vehicle routing problem.Secondly,through the research on the internal logistics management of H-logistics company,it finds the existing problems in the logistics management of H-logistics company.By decomposing the existing problems layer by layer,analyzing cost management and vehicle transportation route planning management in turn,to understand the reasons for the existing problems of H-logistics company.Finally,this thesis combines the current situation of logistics management of H-logistics company and customer needs,and uses the relevant theories of vehicle routing to carry out in-depth research from the following two aspects:（1）Study the Capacitated Vehicle Routing Problem（CVRP）.Considering that e-commerce customers are widely distributed throughout the city,and the cargo volume is small and the delivery frequency is high.In order to improve the optimization effect,it is cancelled of division of service areas.All orders in the city are planned in a unified manner and the trucks start from the warehouse and go to various place of loading in the city.After loading,it is sent back to the warehouse for unloading.First,taking the minimum total transportation cost as the optimization goal and building a mathematical model of one-wharhouse-multiple-place vehicle routing under the constraints of vehicle resource,place of loading,transportation prices,but ignoring the time element.Then,according to the model design improved Dijkstra algorithm and solved.The effect comparison before and after optimization prove that the mathematical model of the vehicle routing established in this thesis is reasonable,and the improved Dijkstra algorithm is effective.Finally,the Genetic Algorithm which is designed according to the model fill the initial solution with the optimization result of the improved Dijkstra algorithm.The effect comparison before and after optimization prove that Genetic Algorithm with improved Dijkstra algorithm’s results as initial solution is effective.It is hoped to provide a reference for CVRP and decision-making.（2）Study the Vehicle Routing Problem with Time windows（VRPTW）.Considering that buyers and sellers can quickly complete online selection and transaction through internet under the e-commerce model,customers have increased psychological expectations for the rapid acquisition of purchased commodities.In order to meet the needs of customers and provide customers with the best service experience,transportation companies need to pick up goods at the time required by customers.taking the minimum total transportation cost as the optimization goal and building a mathematical model of one-wharhouse-multiple-place vehicle routing with time window under the constraints of vehicle resource,place of loading,transportation prices,time requirement.Then,according to the model design improved Dijkstra algorithm with time window and solved.The effect comparison before and after optimization prove that the mathematical model of the vehicle routing established in this thesis is reasonable,and the improved Dijkstra algorithm with time window is effective.It is hoped to provide a reference for VRPTW and decision-making.The research results of this thesis will further enrich the theories and methods in the field of logistics management and intelligent algorithms,provide academic peers with a research reference on vehicle routing problem modeling and intelligent algorithm design,and provide decision-making reference to vehicle routing problem of transportation companies under e-commerce model.