Paper Info
Title
A Novel Meta-heuristic for the Multi-depot Vehicle Routing Problem.
Abstract
Shuffled Frog Leaping Algorithm (SFLA), which was presented by Eusuff and Lansey, is a novel meta-heuristic optimization. In this study, an improved SFLA (ISFLA) which improves the leaping rule of frog by enlarging the leaping step size and adding leaping inertia component in the view of social behavior is proposed to solve the Multi-Depot Vehicle Routing Problem (MDVRP). Considering the MDVRP is combinatorial optimization problem, in which every dimension of solution is discrete, we present a novel real number encoding method of ISFLA for MDVRP. At the same time, the Extremal Optimization (EO) is introduced to ISFLA to further improve the local search ability. The results of experiments have shown the proposed algorithm possesses outstanding performance to solve the MDVRP.
Year
DOI
Venue
2012
10.1007/978-3-642-34038-3_30
ICICA
Keywords
Field
DocType
Integer programming,Combinatorial optimization,Vehicle routing problem,Shuffled frog leaping algorithm
Mathematical optimization,Vehicle routing problem,Extremal optimization,Static routing,Computer science,Destination-Sequenced Distance Vector routing,Combinatorial optimization,Integer programming,Local search (optimization),Distance-vector routing protocol
Conference
Volume
ISSN
Citations 
307
1865-0929
0
PageRank 
References 
Authors
0.34
6
3
Name
Order
Citations
PageRank
Jianping Luo11076.99
Xia Li228743.42
Min-Rong Chen339723.92