Show simple item record

dc.contributor.authorLi, Changheen
dc.contributor.authorYang, Shengxiangen
dc.contributor.authorKorejo, Imtiazen
dc.date.accessioned2013-06-13T13:04:53Z
dc.date.available2013-06-13T13:04:53Z
dc.date.issued2008
dc.identifier.citationLi, C., Yang, S. and Korejo, I. (2008) An adaptive mutation operator for particle swarm optimization. In: Proceedings of the 2008 UK Workshop on Computational Intelligence, UKCI '08, Leicester, 10-12 September, pp. 165-170.en
dc.identifier.urihttp://hdl.handle.net/2086/8739
dc.description.abstractParticle swarm optimization (PSO) is an e cient tool for optimization and search problems. However, it is easy to be trapped into local optima due to its information sharing mechanism. Many research works have shown that mutation operators can help PSO prevent premature convergence. In this paper, several mutation operators that are based on the global best particle are investigated and compared for PSO. An adaptive mutation operator is designed. Experimental results show that these mutation operators can greatly enhance the performanceof PSO. The adaptive mutation operator shows great advantages over non-adaptive mutation operators on a set of benchmark test problems.en
dc.language.isoenen
dc.titleAn adaptive mutation operator for particle swarm optimization.en
dc.typeArticleen
dc.researchgroupCentre for Computational Intelligenceen
dc.peerreviewedYesen
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record