To solve the Logistics Distribution Vehicle Routing Problem(VRP),the Modified Shuffled Frog leaping Algorithm(MSFLA) is advanced.The Greedy Method is applied to solve the VRP with step-by-step answers,which turns VRP into Traveling Salesman Problem(TSP)seeking for route K. Then SFLA was used to offer solution to TSP.But the traditional model of SFLA is not fit for discrete combinatorial optimization problems.So the traditional one is be improved,and the memetic algorithm is brought in.The computational results demonetrate that compared to ant colony optimization ,local search algorithm,genetic algorithm and the hybrid genetic algorithm, SFLA is faster.It has a stronger ability to achieve the most optimistic result,and is easier to be implemented.