Research On Logistics Vehicle Routing Problem Based On An Improved Ant Colony Algorithm

With the development of information technology, logistics is regarded as "the third source of profits ",so more and more people are paying increasingly attention to it. However,the distribution of logistics is directly connected with the important link of custermers,in all the cost of the logistics, distribution costs have a very high proportion, therefore, how to arrange the vehicle routing lines reasonable is becoming an very important work.VRPTW is on the assumption of satisfying the demand of a diversity of users to arrange the line of vehicles reasonable, it is a NP-hard question, thus, using an heuristic algorithm to solve the problem has become the study of an important direction. Ant colony algorithms be a new heuristic algorithm, is wide used to solve the VRPTW problems because of the character of distributed computing, self-organization and its positive feedback. This article analyses the disadvantage of the basic ant algorithm, such as has a partial optimization answer and the slower speed of search, etc. In order to overcome the defects, this article update the information dynamically,and lead-in the nearest neighbor heuristic algorithm and local optimization searching strategy.Finally, simulate the benchmark problems and then proved the improved algorithm is effective to solve the VRPTW.