An improved particle swarm optimization algorithm for global numerical optimization

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents an improved particle swarm optimization algorithm (IPSO) for global numerical optimization. The IPSO uses more particles' information to control the mutation operation. A new adaptive strategy for choosing parameters is also proposed to assure convergence of the IPSO. Meanwhile, we execute the IPSO to solve eight benchmark problems. The results show that the IPSO is superior to some existing methods for finding the best solution, in terms of both solution quality and algorithm robustness. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Zhao, B. (2006). An improved particle swarm optimization algorithm for global numerical optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3991 LNCS-I, pp. 657–664). Springer Verlag. https://doi.org/10.1007/11758501_88

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