The paper is focused on the Min-Max Vehicle Routing Problem (MMVRP). Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the longest route to construct neighborhood structure. For the operation, 1-move and 2-opt were applied, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples.