Research On Logistics Distribution Vehicle Routing Problem Based On Improved Genetic Algorithm

Since the emergence of logistics, it has shown its unique role. It can not only meet the needs of modern business development, but also can effectively promote the social and economic progress.In the logistics system, distribution is not only a part of transportation,but also the core of transportation. Distribution is the process,which is delivering the goods that customer needs from the logistics center to the hands of customers.Therefore,it,which is carrying out a reasonable the distribution path,can not only improve the speed of delivery of goods, but also will have a great influence on the costs of distribution and final benefits.With the popularity of e-commerce, such as Taobao, Jingdong, the number of customers is showing explosive growth, logistics enterprises are developing rapidly, of course, this also makes the distribution more difficult, therefore, the arrangement of the vehicle transport path has become a major problem. Although the vehicle routing problem is a difficult problem to solve, because it can bring considerable economic benefits to the society, there are still many scholars, experts and people from all walks of life to study it.The research of this thesis is to start with the optimization of logistics distribution routing problem. Firstly, I analyze the research background and significance and the present situation of the research on the optimization of logistics distribution route at home and abroad, and point out the problems in the path optimization.Then the vehicle routing problem is analyzed, which mainly includes the general description, classification and basic method of vehicle routing problem. Then the basic principle, operation steps,advantages and disadvantages of the basic genetic algorithm and the improvement of basic genetic algorithm are analyzed. In the end, the improved genetic algorithm,which based on the initialization population, heuristic crossover operator and decision of termination algebra generated by greedy algorithm, is proposed to solve the problems of the basic genetic algorithm in solving CVRP,and the effectiveness of the improved algorithm is verified by an example.