Thumbnail
Access Restriction
Subscribed

Author Kennedy, J. ♦ Eberhart, R.C.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1997
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations
Subject Keyword Particle swarm optimization ♦ Space technology ♦ Statistics ♦ Stochastic processes ♦ Random number generation ♦ Robustness ♦ Routing ♦ Hypercubes ♦ State-space methods
Abstract The particle swarm algorithm adjusts the trajectories of a population of "particles" through a problem space on the basis of information about each particle's previous best performance and the best previous performance of its neighbors. Previous versions of the particle swarm have operated in continuous space, where trajectories are defined as changes in position on some number of dimensions. The paper reports a reworking of the algorithm to operate on discrete binary variables. In the binary version, trajectories are changes in the probability that a coordinate will take on a zero or one value. Examples, applications, and issues are discussed.
Description Author affiliation: Bur. of Labor Stat., Washington, DC, USA (Kennedy, J.)
ISBN 0780340531
ISSN 1062922X
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1997-10-12
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 468.96 kB
Page Count 5
Starting Page 4104
Ending Page 4108


Source: IEEE Xplore Digital Library