Show simple item record

dc.contributor.authorLiu, Hongliang
dc.contributor.authorHowley, Enda
dc.contributor.authorDuggan, Jim
dc.date.accessioned2013-12-19T17:48:55Z
dc.date.available2013-12-19T17:48:55Z
dc.date.issued2011
dc.identifier.citationLiu, H., Howely, E., & Duggan, J. Particle swarm optimisation with gradually increasing directed neighbourhoods. Paper presented at the Proceedings of the 13th annual conference on Genetic and evolutionary computation.en_US
dc.identifier.isbn978-1-4503-0557-0
dc.identifier.urihttp://hdl.handle.net/10379/3936
dc.descriptionConference paperen_US
dc.description.abstractParticle swarm optimisation (PSO) is an intelligent random search algorithm, and the key to success is to effectively balance between the exploration of the solution space in the early stages and the exploitation of the solution space in the late stages. This paper presents a new dynamic topology called "gradually increasing directed neighbourhoods (GIDN)" that provides an effective way to balance between exploration and exploitation in the entire iteration process. In our model, each particle begins with a small number of connections and there are many small isolated swarms that improve the exploration ability. At each iteration, we gradually add a number of new connections between particles which improves the ability of exploitation gradually. Furthermore, these connections among parti- cles are created randomly and have directions. We formalise this topology using random graph representations. Experiments are conducted on 31 benchmark test functions to validate our proposed topology. The results show that the PSO with GIDN performs much better than a number of the state of the art algorithms on almost all of the 31 functions.en_US
dc.formatapplication/pdfen_US
dc.language.isoenen_US
dc.publisherAssociation for Computing Machineren_US
dc.relation.ispartofThe Genetic and Evolutionary Computation Conference, (GECCO 2011),en
dc.subjectParticle swarm optimisationen_US
dc.subjectDynamic topologiesen_US
dc.subjectNeighbourhood topologiesen_US
dc.subjectExploration and exploitationen_US
dc.titleParticle swarm optimisation with gradually increasing directed neighbourhoodsen_US
dc.typeConference Paperen_US
dc.date.updated2013-09-18T14:52:32Z
dc.local.publishedsourcehttp://dx.doi.org/10.1145/2001576.2001582en_US
dc.description.peer-reviewednon-peer-reviewed
dc.contributor.funder|~|
dc.internal.rssid1146696
dc.local.contactJames Duggan, Dept. Of Information Technology, I.T. Building, Nui Galway. 3336 Email: james.duggan@nuigalway.ie
dc.local.copyrightcheckedYes
dc.local.versionDRAFT
nui.item.downloads459


Files in this item

Attribution-NonCommercial-NoDerivs 3.0 Ireland
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. Please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.

The following license files are associated with this item:

Thumbnail

This item appears in the following Collection(s)

Show simple item record