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

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Li, Y., Li, D., & Wang, D. (2012). Quantum-behaved particle swarm optimization algorithm based on border mutation and chaos for vehicle routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7331 LNCS, pp. 63–73). https://doi.org/10.1007/978-3-642-30976-2_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free