Modified shuffled frog leaping algorithm applying on logistics distribution vehicle rounting problem

Author

Li, Yan ; Xiu-fen, Kong ; Rui-qing, Hao

Author_Institution

Sch. of Mech. Eng., Xi´´an Technol. Univ., Xi´´an, China

Volume

4

fYear

2011

fDate

15-17 Oct. 2011

Firstpage

2277

Lastpage

2280

Abstract

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.

Keywords

genetic algorithms; logistics; search problems; transportation; travelling salesman problems; MSFLA; TSP; VRP; ant colony optimization; discrete combinatorial optimization; greedy method; hybrid genetic algorithm; local search algorithm; logistics distribution vehicle rounting problem; memetic algorithm; modified shuffled frog leaping algorithm; step-by-step answers; traveling salesman problem; Algorithm design and analysis; Genetic algorithms; Logistics; Memetics; Optimization; Routing; Vehicles; Shuffled Frog Leaping Algorithm(SFLA); Traveling Salesman Problem(TSP); Vehicle Routing Problem(VRP); the Greedy Method;

fLanguage

English

Publisher

ieee

Conference_Titel

Biomedical Engineering and Informatics (BMEI), 2011 4th International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4244-9351-7

Type

conf

DOI

10.1109/BMEI.2011.6098776

Filename

6098776