Study on Distribution Routing Optimization Problem of Tobacco Distribution Center

The vehicle routing problem(VRP) of tobacco distribution center was discussed. The corresponding mathematical model for VRP was builded, on the basis of the traditional simulated annealing algorithm, a parallel simulated annealing algorithm based on memory function was proposed to solve VRP model, It used simulated data to verify the VRP model and algorithm. The results show that improved algorithm, besides being capable of achieving satisfactory results, is also superior in computational efficiency, convergence rate and capacity of optimization, and it has strong practicability.