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

Abstract: 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.

Key words: fireworks algorithm, quantum evolutionary algorithm, variable neighborhood search, Capacitated Vehicle Routing Porblem（CVRP）, largest order value