Optimization of Multi-compartment Vehicle Routing Problem in Delivery Mode

With the rapid development of social life, the demand for refined oil is increasing rapidly. Therefore, the problem of vehicle routing problem is more and more concerned by domestic and foreign scholars. On the basis of the classical vehicle routing problem, the vehicle routing problem of multi tank is extended by combining the background of the finished product and the vehicle transportation. In this paper, the mathematical model of the distribution path of the multi tank truck is established firstly, the different oil is transported in the same position with the vehicle, the objective function is the lowest cost. Then, the hybrid algorithm of simulated annealing and tabu search is improved. The model and algorithm are applied to the actual delivery task of a company and compared with the actual business data. The cost of distribution is obviously reduced, and the improved hybrid algorithm can be effectively solved. It proved that the improved hybrid algorithm can effectively solve the problem of multi distribution storage tanker vehicles.