Paper Info
Title
A novel hybrid shuffled frog leaping algorithm for vehicle routing problem with time windows
Abstract
This paper proposes a novel hybrid shuffled frog leaping algorithm (HSFLA) for vehicle routing problem with time windows (VRPTW). The diversity control strategy is developed to construct the memeplexes of the HSFLA and avoid ending the search prematurely. The modified clone selection procedure is presented to improve the quality of the solutions and bring more diversity to the population. Improved and extended extremal optimization (EO) with alternative move operators is also introduced to the exploitation of the algorithm. Furthermore, the adaptive soft time windows penalty measure is proposed to allow the existence of infeasible solutions in the evolution process. Our approach is estimated and compared with other state-of-the-art heuristics using Solomon and Cordeau VRPTW test sets. The experimental results show that the presented algorithm is very effective for handling VRPTW. (C) 2015 Elsevier Inc. All rights reserved.
Year
DOI
Venue
2015
10.1016/j.ins.2015.04.001
Information Sciences
Keywords
Field
DocType
PROJECT SCHEDULING PROBLEM,MULTIOBJECTIVE OPTIMIZATION,EXTREMAL OPTIMIZATION,GENETIC ALGORITHM,PARAMETER-IDENTIFICATION,SEARCH,MODEL,CONSTRAINTS,MANAGEMENT,DISPATCH
Population,Mathematical optimization,Vehicle routing problem,Extremal optimization,Algorithm,Evolutionary computation,Combinatorial optimization,Heuristics,Operator (computer programming),Mathematics,Shuffled frog leaping algorithm
Journal
Volume
Issue
ISSN
316
C
0020-0255
Citations 
PageRank 
References 
17
0.57
47
Authors
4
Name
Order
Citations
PageRank
Jianping Luo11076.99
Xia Li2351.88
Min-Rong Chen339723.92
Hongwei Liu437663.93