File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A non-revisiting particle swarm optimization

TitleA non-revisiting particle swarm optimization
Authors
Issue Date2008
PublisherInstitute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4235
Citation
The 2008 IEEE Congress on Evolutionary Computation (CEC 2008), Hong Kong, China, 1-6 June 2008. In IEEE Transactions on Evolutionary Computation, 2008, p. 1879-1885 How to Cite?
AbstractIn this article, a non-revisiting particle swarm optimization (NrPSO) is proposed. NrPSO is an integration of the non-revisiting scheme and a standard particle swarm optimization (PSO). It guarantees that all updated positions are not evaluated before. This property leads to two advantages: 1) it undisputedly reduces the computation cost on evaluating a time consuming and expensive objective function and 2) It helps prevent premature convergence. The non-revisiting scheme acts as a self-adaptive mutation. Particles genericly switch between local search and global search. In addition, since the adaptive mutation scheme of NrPSO involves no parameter, comparing with other variants of PSO which involve at least two performance sensitive parameters, the performance of NrPSO is more reliable. The simulation results show that NrPSO outperforms four variants of PSOs on optimizing both uni-modal and multi-modal functions with dimensions up to 40. We also illustrate that the overhead and archive size of NrPSO are insignificant. Thus NrPSO is practical for real world applications. In addition, it is shown that the performance of NrPSO is insensitive to the specific chosen values of parameters. © 2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/196700
ISBN
ISSN
2015 Impact Factor: 5.908
2015 SCImago Journal Rankings: 4.308

 

DC FieldValueLanguage
dc.contributor.authorChow, CK-
dc.contributor.authorYuen, SY-
dc.date.accessioned2014-04-24T02:10:34Z-
dc.date.available2014-04-24T02:10:34Z-
dc.date.issued2008-
dc.identifier.citationThe 2008 IEEE Congress on Evolutionary Computation (CEC 2008), Hong Kong, China, 1-6 June 2008. In IEEE Transactions on Evolutionary Computation, 2008, p. 1879-1885-
dc.identifier.isbn978-1-4244-1822-0-
dc.identifier.issn1089-778X-
dc.identifier.urihttp://hdl.handle.net/10722/196700-
dc.description.abstractIn this article, a non-revisiting particle swarm optimization (NrPSO) is proposed. NrPSO is an integration of the non-revisiting scheme and a standard particle swarm optimization (PSO). It guarantees that all updated positions are not evaluated before. This property leads to two advantages: 1) it undisputedly reduces the computation cost on evaluating a time consuming and expensive objective function and 2) It helps prevent premature convergence. The non-revisiting scheme acts as a self-adaptive mutation. Particles genericly switch between local search and global search. In addition, since the adaptive mutation scheme of NrPSO involves no parameter, comparing with other variants of PSO which involve at least two performance sensitive parameters, the performance of NrPSO is more reliable. The simulation results show that NrPSO outperforms four variants of PSOs on optimizing both uni-modal and multi-modal functions with dimensions up to 40. We also illustrate that the overhead and archive size of NrPSO are insignificant. Thus NrPSO is practical for real world applications. In addition, it is shown that the performance of NrPSO is insensitive to the specific chosen values of parameters. © 2008 IEEE.-
dc.languageeng-
dc.publisherInstitute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4235-
dc.relation.ispartofIEEE Transactions on Evolutionary Computation-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rightsIEEE Transactions on Evolutionary Computation. Copyright © Institute of Electrical and Electronics Engineers.-
dc.titleA non-revisiting particle swarm optimization-
dc.typeConference_Paper-
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/CEC.2008.4631045-
dc.identifier.scopuseid_2-s2.0-55749092762-
dc.identifier.spage1879-
dc.identifier.epage1885-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 160603 amended-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats