计算机应用研究2012，Vol.29Issue(1)：60-62,71,4.DOI:10.3969/j.issn.1001-3695.2012.01.016
基于Memetic算法的带时间窗车辆路径问题研究
Memetic algorithm for vehicle routing problem with time windows
摘要
Abstract
This paper proposed a Memetic algorithm, which simulated the process of culture evolution, to solve vehicle routing problem with time windows(VRPTW). To convert VRPTW into continuous problem, it designed a real coding method. The memetic algorithm helped the particles which had certain learning capacity accelerate convergence rate by local search strategy. Meanwhile, because of helping some particles which fell into the local optimum escape from local optimum by tabu search, it enhanced the diversity of swarm. The experimental result shows that the proposed algorithm can gel the solution more effectively and it is an effective method for VRPTW.关键词
带时间窗车辆路径问题/文化基因算法/粒子群算法/禁忌搜索Key words
VRPTW/ Memetic algorithm/ PSO/ tabu分类
信息技术与安全科学引用本文复制引用
吴雷,魏臻,葛方振..基于Memetic算法的带时间窗车辆路径问题研究[J].计算机应用研究,2012,29(1):60-62,71,4.基金项目
国家自然科学基金资助项目(60873195,61070220) （60873195,61070220）
高等学校博士学科点专项科研基金资助项目(20090111110002) （20090111110002）
