X Group Transport Vehicle Routing Problem Research

In recent years, with the reduction in the first and second profit source of profit margins, and national attention to the logistics industry, more and more companies begin to focus on the third profit source—logistics. As a strong company, X Group has begun to focus on their logistics. In this paper, according to the X Group scheduling status of vehicle transport, we build a mathematical model and research it.The vehicle routing problem of X Group exactly is a vehicle routing problem with simultaneous pickup and delivery, at present, the research on this problem is still not deep enough, morever X Group has a lot of distribution points, which requires a algorithms of less time-consuming and better solution quality. For the practical application of X group, we present a first allocation of vehicles, and then sub-optimal heuristic algorithms. First, according to the transport character-ristics of the more recent clients typically use the same vehicle,we use the Scanning and Genetic Algorithm.Second, we use a modified particle swarm algorithm to calculate the specific vehicle distribution program. PSO based on Pre-assigned customer is better than a random distribution, which ensures fast convergence of the particle in flight, and help in the short period of time to find on better solutions.In order to verify the effectiveness and efficiency of our algorithm, a lot of simulation experiments have been carried out, including experiments on VRP and VRPSPD. Then we do some experiments based on the actual agents of X Group.Finally, the thesis provides further problems of vehicle routing problem for the X group, which is useful to the next research.