Please use this identifier to cite or link to this item: https://doi.org/10.1145/1671948.1671949
DC FieldValue
dc.titleParticle swarm optimizer with adaptive tabu and mutation: A unified framework for efficient mutation operators
dc.contributor.authorWang, Y.-X.
dc.contributor.authorXiang, Q.-L.
dc.contributor.authorZhao, Z.-D.
dc.date.accessioned2013-07-04T07:51:46Z
dc.date.available2013-07-04T07:51:46Z
dc.date.issued2010
dc.identifier.citationWang, Y.-X., Xiang, Q.-L., Zhao, Z.-D. (2010). Particle swarm optimizer with adaptive tabu and mutation: A unified framework for efficient mutation operators. ACM Transactions on Autonomous and Adaptive Systems 5 (1). ScholarBank@NUS Repository. https://doi.org/10.1145/1671948.1671949
dc.identifier.issn15564665
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39882
dc.description.abstractEvolutionary Algorithms (EAs) and Swarm Intelligence (SI) are widely used to tackle black-box global optimization problems when no prior knowledge is available. In order to increase search diversity and avoid stagnation in local optima, the mutation operator was introduced and has been extensively studied in EAs and SI-based algorithms. However, the performance after introducing mutation can be affected in many aspects and the parameters used to perform mutations are very hard to determine. For the purpose of developing efficient mutation operators, this article proposes a unified tabu and mutation framework with parameter adaptations in the context of the Particle Swarm Optimizer (PSO). The proposed framework is a significant extension of our preliminary work [Wang et al. 2007]. Empirical studies on 25 benchmark functions indicate that under the proposed framework: (1) excellent performance can be achieved even with a small number of mutations; (2) the derived algorithm consistently performs well on diverse types of problems and overall performance even surpasses the state-of-the-art PSO variants and representative mutationbased EAs; and (3) fast convergence rates can be preserved despite the use of a long jump mutation operator (the Cauchy mutation). © 2010 ACM.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1145/1671948.1671949
dc.sourceScopus
dc.subjectEvolutionary algorithm
dc.subjectGlobal optimization
dc.subjectMutation operator
dc.subjectParameter adaptation
dc.subjectSwarm intelligence
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1145/1671948.1671949
dc.description.sourcetitleACM Transactions on Autonomous and Adaptive Systems
dc.description.volume5
dc.description.issue1
dc.identifier.isiut000275117800001
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

16
checked on Mar 23, 2020

WEB OF SCIENCETM
Citations

15
checked on Mar 23, 2020

Page view(s)

119
checked on Mar 22, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.