WoSP: a multi-optima particle swarm algorithm
When investigating multi-optima problems, a particle swarm algorithm should not converge on single optima but ideally should explore many optima by continual searching. The common practice of only evaluating each particle's performance at discrete intervals can, at small computational cost, be used to adjust particle behaviour in situations where the swarm is 'settling' so as to encourage the swarm to explore further. An algorithm is proposed that, by making each wave of particles partially independent, is suitable for multi-optima problems.
History
Available versions
PDF (Published version)Publisher DOI
ISBN
9780780393639Conference name
2005 IEEE Congress on Evolutionary Computation, Edinburgh, Scotland, United Kingdom, 02-05 September 2005Volume
1Pagination
7 ppPublisher
IEEECopyright statement
Copyright © 2005 IEEE. The published version is reproduced in accordance with the copyright policy of the publisher. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.Language
engUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC