Modified Shuffled Frog leaping Algorithm Applying on Logistics Distribution Vehicle Rounting Problem
To solve the Logistics Distribution Vehicle Routing Problera(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.lt has a stronger ability to achieve the most optimistic result,and is easier to be implemented.
Vehicle Routing Problem(VRP) Traveling Salesman Problem(TSP) the Greedy Method Shuffled Frog Leaping Algorithm(SFLA)
YANLi KONG Xiu-fen HAO Rui-qing
School of Mechanical Engineering,Xian Technological University, Xian 710032,China
国际会议
上海
英文
2259-2262
2011-10-15（万方平台首次上网日期，不代表论文的发表时间）