Quantum-Behaved particle swarm optimization algorithm based on border mutation and chaos for vehicle routing problem

Authors:
Ya Li;Dan Li;Dong Wang
Affiliations:
Dept. of Computer, School of Electrical&Information Engineering, Foshan University, Foshan, Guangdong, China;Technology&Information Center, XinYang Power Supply Company, Xinyang, Henan, China;Dept. of Computer, School of Electrical&Information Engineering, Foshan University, Foshan, Guangdong, China
Venue:
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
Year:
2012

Citing 1
Cited 0

The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A quantum-behaved particle swarm optimization based on border mutation and chaos is proposed for vehicle routing problem(VRP).Based on classical Quantum-Behaved Particle Swarm Optimization algorithm(QPSO), when the algorithm is trapped in local optimum, chaotic search is used for the optimal particles to enhance the optimization ability of the algorithm, avoid getting into local optimum and premature convergence. To thosecross-border particles,mutation strategy is used to increase the variety of swarm and strengthen the global search capability. This algorithm is applied to vehicle routing problem to achieve good results.