CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Multi-Objective Particle Swarm Optimisation Methods
Authors
Jonathan E. Fieldsend
Publication date
11 July 2013
Publisher
University of Exeter Press
Abstract
Copyright © 2004 University of ExeterThis study compares a number of selection regimes for the choosing of global best (gbest) and personal best (pbest) for swarm members in multi-objective particle swarm optimisation (MOPSO). Two distinct gbest selection techniques are shown to exist in the literature, those that do not restrict the selection of archive members and those with `distance' based gbest selection techniques. Theoretical justification for both of these approaches is discussed, in terms of the two types of search that these methods promote, and the potential problem of particle clumping in MOPSO is described. The popular pbest selection methods in the literature are also compared, and the ffect of the recently introduced turbulence term is viewed in terms of the additional search it promotes, across all parameter combinations. In light of the discussion, new avenues of MOPSO research are highlighted.Department of Computer Science, University of Exete
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Supporting member
Open Research Exeter
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:ore.exeter.ac.uk:10871/117...
Last time updated on 06/08/2013