The Research And Implementation Of Vehicle Routing Generation Strategy In Logistics Distribution

Logistics distribution is an operation linking with consumer directly,and takes account for considerable proportion in variable costs in logistics,and the planning of vehicle routing in distributing will be take great effects in cost in logistics distribution.A scientific and reasonable solution to the vehicle path planning problem is an important activity in the logistics distribution.This research is about VRP(vehicle routing problem) in the modern logistics distribution procedure.Real logistics distribution is characterized by multi distribution center,large scale,many restrictions and advanced complexity.And the strategy of vehicle routing generation based on the strategy of "cluster first, route second" is put forward. Firstly, large-scale VRP is simplified into small-scale VRP by using k-means cluster analysis to divide the distribution in order to reduce computation while improve the computing speed; and then introduce a hybrid heuristic algorithm which combines the improved push forward insertion heuristic algorithm and the variable neighbor search algorithm in order to solve the vehicle routing optimization problems in delivery region.Based on the above strategy, the main work of this paper is as follows:(1) Method for distribution area division and customer clustering.The principle of distribution area division and customer classification is first presented. Then we use the improved K-Means clustering algorithm to automatic divide the delivery region in order to reduce the complexity of solving problems.(2) The VRPTW mathematical model construction and feasible vehicle routing solution.In order to solve the vehicle routing optimization problems in delivery region,a improved push forward insertion heuristic algorithm was used in order to generate initial feasible vehicle routing problems in delivery region.Then a set of feasible routing schemes is achieved.(3) Vehicle routing improvement and optimization.In order to improve the vehicle routing solution and improve the computing efficiency and quality of generated initial vehicle routing, algorithm uses the voronoi polygon adjacency information to define the operation of variable neighborhood search in order to improve and optimize the initial feasible vehicle routing.(4) The implementation of the tobacco distribution prototype system.Based on the proposed vehicle routing generation strategy, a vehicle routing generation tobacco prototype system was designed and realized.This vehicle routing generation strategy can achieve a better solution to vehicle route optimization problems through the experiment results and the analysis and verification of the application system. At the same time, it also has better real-time which can meet the needs of practical application.