Particle Swarm Optimization Based On Predatory Search For Vehicle Routing Problem

With the deepening of the social division of labor and developing of economic, the function and role of the logistics are expanding. As an important part of the logistics system, the logistics system research focus on logistics distribution optimization. Practically, in order to make logistics distribution enterprises optimize the distribution path, reduce distribution costs and improve logistics management and increase the competitiveness of the enterprises, logistics distribution of Vehicle Routing Problem(VRP) has been increasingly important. The VRP is not only the core of logistics distribution, but also one of the focus of research. In reality, reasonable arrangements for vehicle routing can improve transport efficiency and reduce service costs effectively.Since the VRP was put forward, the experts and scholars have carried out extensive research. It has been many mature algorithm that provided basis for continuing the question.Firstly, this paper analyzed the status quo of the VRP, describted and classified the general VRP, and summarized the existing algorithm for solving VRP. Secondly,it introduced the Particle Swarm Optimization(PSO) on basic concepts, mathematical models and algorithms process. Lastly, it described the Predator Search strategy.On this basis, in order to solve the VRP, the PSO algorithm based on the Predator Search strategy was designed in this paper. It regulated the restrictions of the Predator Search strategy, for achieving increase or decrease in the PSO search space . Moreover, it balanced the the ability for exploring and developing, that can make the PSO get the optimal solution. The PSO was implentmented with C++ Comiler, and applied the technique to an actual problem, and proved the feasibility and validity of the algorithm. The use of the algorithm for vehicle routing problem was an advisable method.