计算机技术与发展2016，Vol.26Issue(9)：187-191,5.DOI:10.3969/j.issn.1673-629X.2016.09.042
求解CVRP问题的改进和声算法
An Improved Harmony Search Algorithm for CVRP
摘要
Abstract
Vehicle routing problem is a typical NP-hard problem,mostly solved by a heuristic algorithm. Harmony search algorithm,as a novel heuristic algorithm,has been developing rapidly in recent years. However,the research on vehicle routing problem by the harmony search algorithm is not sufficient. The existing harmony search algorithms for CVRP have some defects on efficiency. To address the prob-lem,an improved harmony search algorithm is proposed,which uses natural number coding. It adds constraints to new harmonies to avoid generating invalid solutions,and optimizes new harmonies by 2-opt algorithm,so that it can compress the search solution space and im-prove the efficiency. Compared with several improved GA,PSO,experiments show that the proposed algorithm outperforms the existing algorithms on efficiency.关键词
车辆路径优化问题/容量约束的车辆路径问题/和声算法/组合优化Key words
vehicle routing problem/capacitated vehicle routing problem/harmony search algorithm/combinatorial optimization分类
信息技术与安全科学引用本文复制引用
颜腾威,王丽侠,周杰,王基一..求解CVRP问题的改进和声算法[J].计算机技术与发展,2016,26(9):187-191,5.基金项目
国家自然科学基金资助项目(61170108,61402418) （61170108,61402418）
教育部人文社科研究项目(12YJCZH142) （12YJCZH142）
浙江省自然科学基金(LQ13F020007) （LQ13F020007）
