A multiagent genetic particle swarm optimization

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

Abstract

The efforts of this paper are proposing a multi-agent genetic particle swarm optimization algorithm (MAGPSO) by introducing the multi-agent system to the particle swarm optimization(PSO) algorithm. Through the competition and cooperation operation with its neighbors, the neighborhood random crossing operation within its neighboring area, the mutation operation, and combining the evolutionary mechanism of the PSO algorithm, every individual senses local environment unceasingly, and affects the entire agent grid gradually, so that it enhances its fitness to the environment. This algorithm can maintain the diversity of the swarm effectively, and improve the precision of optimization, and simultaneously, restrain the prematurity phenomenon efficiently. The results of testing three high dimension benchmark function and comparing with some optimization results of other methods illustrate this algorithm has higher optimization performance in the field of high dimension functions optimization. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wang, L., Hong, Y., Zhao, F., & Yu, D. (2008). A multiagent genetic particle swarm optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5370 LNCS, pp. 659–668). https://doi.org/10.1007/978-3-540-92137-0_72

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