Group search optimizer with interactive dynamic neighborhood

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

Abstract

Group search optimizer(GSO) is a new novel optimization algorithm by simulating animal behaviour. It uses the Gbest topology structure, which leads to rapid exchange of information among particles. So,it is easily trapped into a local optima when dealing with multi-modal optimization problems. In this paper,inspiration from the Newman and Watts model,a improved group search optimizer with interactive dynamic neighborhood (IGSO) is proposed. Adopting uniform design and the linear regression method on the parameter selection, four benchmark functions demonstrate the effectiveness of the algorithm. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

He, G., Cui, Z., & Zeng, J. (2011). Group search optimizer with interactive dynamic neighborhood. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7004 LNAI, pp. 212–219). https://doi.org/10.1007/978-3-642-23896-3_25

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