 |
bibtex-reference |
@INPROCEEDINGS{Kennedy1997,
author={Kennedy, J. and Eberhart, R.C.},
booktitle={Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on},
title={A discrete binary version of the particle swarm algorithm},
year={1997},
volume={5},
pages={4104-4108 vol.5},
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},
keywords={optimisation;probability;problem solving;continuous space;discrete binary version;optimization;particle swarm algorithm;performance;population;position changes;probability;problem solving;trajectories;Hypercubes;Particle swarm optimization;Random number generation;Robustness;Routing;Space technology;State-space methods;Statistics;Stochastic processes},
doi={10.1109/ICSMC.1997.637339},
ISSN={1062-922X},} |
 |
standard-reference |
Kennedy, J. & Eberhart, R. C. (1997). A discrete binary version of the particle swarm algorithm, Conference on Systems, Man, and Cybernetics, Piscataway, NJ: IEEE Service Center, pp. 4104-4109 |