2005 | OriginalPaper | Buchkapitel
Crowd Avoidance Strategy in Particle Swarm Algorithm
verfasst von : Guimin Chen, Qi Han, Jianyuan Jia, Wenchao Song
Erschienen in: Computational Intelligence and Security
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
To improve the linearly varying inertia weigh particle swarm optimization method (LPSO), a new concept of Crowd Avoidance is introduced in this paper. In this newly developed LPSO (CA-LPSO), particles can avoid entering into a crowded space while collaborate with other particles searching for optimum. Four well-known benchmarks were used to evaluate the performance of CA-LPSO in comparison with LPSO. The simulation results show that, although CA-LPSO falls behind LPSO when optimizing simple unimodal problems, it is more effective than LPSO for most complex functions. The crowd avoidance strategy enables the particles to explore more areas in the search space and thus decreases the chance of premature convergence.