变邻域量子烟花算法求解CVRP  

Variable Neighborhood Quantum Fireworks Algorithm for Solving CVRP

作　　者：蔡延光[1] 陈厚仁[1] 戚远航 CAI Yanguang;CHEN Houren;QI Yuanhang(School of Automation, Guangdong University of Technology, Guangzhou 510006, China)

机构地区：[1]广东工业大学自动化学院,广州510006

出　　处：《计算机工程与应用》2019年第9期230-236,共7页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61074147);广东省自然科学基金(No.S2011010005059);广东省教育部产学研结合项目(No.2012B091000171;No.2011B090400460);广东省科技计划项目(No.2012B050600028;No.2014B010118004;No.2016A050502060);广州市花都区科技计划项目(No.HD14ZD001);广州市科技计划项目(No.201604016055)

摘　　要：针对带容量约束的车辆路径问题,提出一种融合量子进化算法和变邻域优化策略的变邻域量子烟花算法。该算法采用等分随机键与最大位置法结合的实数编码方式,通过量子旋转门和非门变异提高算法全局搜索能力,同时运用结合2-Opt的变邻域优化策略加强局部搜索能力。选取17个基准算例进行参数实验和对比实验,实验结果表明,相对于对比算法,所提出的算法具有较好的寻优能力和收敛速度。For the capacitated vehicle routing problem, this paper proposes a variable neighborhood quantum firework algorithm which integrates the quantum evolutionary algorithm and variable neighborhood optimization strategy. The proposed algorithm adopts a real number encoding method which combines uniform random keys and largest order value strategy. In addition, the proposed algorithm applies the quantum revolving door and gate mutation to improve the global search ability. Moreover, the proposed algorithm uses the variable neighborhood optimization strategy with 2-Opt to enhance the local search performance. 17 benchmark instances are applied to the parameter experiment and the comparison experiment. The experimental results show that, compared with the alternative algorithms, the proposed algorithm has a better optimal ability and a convergence speed.

关 键 词：烟花算法 量子进化算法 变邻域搜索 容量约束车辆路径问题(CVRP) 最大位置法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]