2007•Unpublished venueRequires access

The Particle Swarm Optimization Algorithm: How to Select the Number of Iteration

Bo Li, Xiao Ren-yue

Abstract

The particle swarm optimization algorithm is an algorithm to find optimal regions of complex spaces through the interaction of individuals. The number of iterations required to meet a termination criterion is a critical dependent variable in the particle swarm optimization algorithm. In this paper, we analyze how to select the number of iteration. It can be seen as a guideline to the particle swarm optimization.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Particle swarm optimization, Computer science, Mathematical optimization, Multi-swarm optimization, Algorithm, Mathematics