Research On Vehicle Routing Problem Based On Joint Distribution

With the continuous deepening of China's urbanization process and the continuous improvement of network technology,the number of urban population and the required living resources have risen sharply.Under this situation,China's urban logistics industry is developing rapidly,but at present domestic logistics enterprises are relatively independent and not integrated into the complete industrial chain.Therefore,with the growth of distribution vehicles in the process of logistics and distribution,on the one hand,the profit margin of related enterprises is reduced,and on the other hand,the healthy development of the city is hindered.In real life,it can be seen that the traditional single distribution mode has gradually not adapted to the development of society,and new distribution modes such as joint distribution have gradually emerged.However,there are still many problems that need to be solved in the development of the common distribution model.For example,how to integrate existing resources,how to improve customer satisfaction while reducing logistics and distribution costs,and thus gain greater profits? Therefore,this paper studies the vehicle routing problem based on the concept of joint distribution,which has more theoretical and practical significance.Firstly,this paper briefly expounds the basic meaning of joint distribution,and briefly analyzes its cooperation mode and integrated resource objects.It proposes four common distribution strategies for different integrated resource objects,including three resources of customers,vehicles and distribution centers.Secondly,this paper briefly analyzes the principle,mathematical model and design flow of ant colony algorithm and its evolutionary algorithm-polymorphic ant colony algorithm,and summarizes its corresponding advantages and disadvantages.Then,based on the common distribution strategy one and strategy three,namely,the integration of customer resource strategy and integrated vehicle resource strategy,this paper proposes the vehicle routing problem based on customer sharing and vehicle sharing respectively,and when constructing the corresponding mathematical model,in order to improve Customer satisfaction,adding conditional constraints for soft time windows.According to the basic theory of polymorphic ant colony algorithm,in the design of multi-state ant colony algorithm with clustering and adaptive polymorphic ant colony algorithm,in order to improve the convergence speed of the algorithm,a 2-opt local optimization algorithm is used.Used to solve the corresponding problem.Finally,the paper designs an example,adopts three distribution center points and 20 customer points,solves the different solutions and different solutions of the proposed solution,and uses MATLAB R2015 a simulation software to realize the designed algorithm and related problems.The solution proves the validity of the model.At the same time,the practicality of the algorithm is verified by comparing the convergence speed with the basic polymorphic ant colony algorithm.It provides a reference for future scholars to solve related vehicle routing problems and how to implement common distribution.