带时间窗车辆路径问题的混合量子粒子群算法

针对带时间窗的车辆路径问题，采用混合量子粒子群算法对该问题进行了求解，该算法将量子粒子群算法与模拟退火算法相结合．充分发挥量子粒子群算法全局寻优能力强以及模拟退火算法局部寻优能力强的特点，从而能有效地避免早熟。仿真结果表明，该算法不仅收敛速度快，而且还具有较高的求解质量。

Solve Vehicle Routing Problem With Time Windows Based on Hybrid Quantum Particle Swarm Algorithm

Coping with vehicle routing problem with time windows, the method that hybrid quantum particle swarm algorithm is proposed to be applied to it, this algorithm combined with quantum particle swarm algorithm and simulated annealing algorithm to overcome the problem of premature, which effectively employs both the ability to jump Out of the local minima in simulated annealing and the capacity of searching the global optimum in quantum particle swarm algorithm. The result shows that this algorithm has better answers and more rapid convergence.