A quantum particle swarm optimization for solving the capacitated vehicle routing problem

The problem of capacitated vehicle routing optimization is studied. Firstly, the mathematic model of VRP and PSO is given. An improved quantum particle swarm optimization is presented. 2-opt and 1-1 opt is used to optimize the inner and outer route. The population entropy is introduced to check whether the algorithm is trapped into local optimization or not, and cataclysm is adopted to ensure the diversities of the solution spaces. The detailed solving steps of VRP based on QPSO are given. Experiment simulation is tested, which shows that QPSO has better performance in searching efficiency and premature problem compared to the other algorithms.