期刊
INFORMATION SCIENCES
卷 316, 期 -, 页码 266-292出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2015.04.001
关键词
Hybrid heuristic; Combinatorial optimization; Evolutionary computation; Shuffled frog leaping algorithm; Vehicle routing problem
资金
- National Natural Science Foundation of China [61301298, 61171124, 61373158]
- Scientific Research and Development Foundation of Shenzhen [JCYJ20120613161222123, JCYJ2013032911062410, JCYJ20120613115442060]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据