A Shuffled Frog Leaping Algorithm for Solving Vehicle Routing Problem
2012 ◽
Vol 197
◽
pp. 529-533
◽
Keyword(s):
For vehicle routing problem, its model is easy to state and difficult to solve. The shuffled frog leaping algorithm is a novel meta-heuristic optimization approach and has strong quickly optimal searching power. The paper applies herein this algorithm to solve the vehicle routing problem; presents a high-efficiency encoding method based on the nearest neighborhood list; improves evolution strategies of the algorithm in order to keep excellent characteristics of the best frog. This proposed algorithm provides a new idea for solving VRP.
2014 ◽
Vol 41
(5)
◽
pp. 2535-2545
◽
2018 ◽
Vol 2018
◽
pp. 1-10
◽
2012 ◽
Vol 42
(2)
◽
pp. 254-267
◽