Research And Application Of Vehicle Routing Problem Based On The Artificial Bee Colony Algorithm

With the rapid development of Internet economy and technology and the speeding up of world economic integration, the logistics activity in social life and enterprise management status becomes more and more important, many enterprises regard logistics as one of the important ways to promote enterprise’s core competitiveness. Meanwhile, the statistics show that China’s logistics costs compared with the developed countries has a considerable gap.This shows that raise the level of logistics management is the need of reality, also has a huge space for development, the subject has broad prospects and important significance. In Logistics management, reasonable logistics arrangements in economic benefits at the same time also provide guarantee for the realization of the scientific management, and vehicle routing arrangement is the key link in the logistics arrangement, so this project choose to research the vehicle routing problem to improve logistics efficiency, has important practical value. And vehicle routing problem is the operational research theory and the practical embodiment of combinatorial optimization theory, known as the "operational research in recent decades one of the most successful research", so the research on vehicle routing problem also has profound theoretical significance.After years of development, the research of vehicle routing problem and its algorithm has achieved a lot of research results. Because artificial bee colony algorithm is a relatively new algorithm, the algorithm in the application of vehicle routing problem is relatively few,and the research is not comprehensive enough. In order to enrich the ways to solve vehicle routing problem, and seek the precision of vehicle routing problem solution, the paper studies the main line for the vehicle routing problem, artificial bee colony algorithm and its improved algorithms are studied. First of all, the key parameters in artificial bee colony algorithm are discussed. The main contents are as follows:(1) For full load vehicle routing problem presents an improved artificial bee colony algorithm. First of all, the discretization process for artificial colony algorithm; In order to avoid the rapid convergence to local optimal, puts forward the probability calculation method based on median; In order to improve the searching efficiency of scout bees, proposed the idea of genetic scout bees search strategy. The analysis of the contrast test shows that the improved artificial colony algorithm is effective.(2) For the full load problem adversely affect the accuracy of the optimal solution, we studied the improved artificial colony algorithm of non-full load vehicle routing problem. In the improved algorithm, according to the characteristics of problem, we adopt twodimensional coding in solution; which is initialized by saving-insert method; adopt variableneighborhood search approach to the neighborhood search. Compared with standard database and the results of the literature analysis, improved artificial colony algorithm is reliable on the precision of the solution.(3) In order to further study of vehicle routing problem, we study the vehicle routing problem with time Windows of artificial colony algorithm. To simplify the calculation process,in addition to retain the full load vehicle routing problem of the basic content of artificial colony algorithm, the more compact structure of neighborhood search is adopted.Through the experimental analysis of standard database examples, artificial colony algorithm to solve the vehicle routing problem with time Windows has a certain competitiveness.In this paper, the standard and the vehicle routing problem with time Windows, using artificial colony algorithm are studied respectively. Algorithm of experiment analysis and comparison, the full load artificial colony algorithm compared with the not fully loaded, less calculation time, but the calculation accuracy is poor; Artificial colony algorithm can applied in the vehicle routing problem with time Windows successfully. The research achievements in this paper offer a new way for the vehicle routing problem solving and using for reference.