Abstract

Notice of Violation of IEEE Publication Principles <br><br> “The Study on Dynamic Population Size Improvements for Classical Particle Swarm Optimization” by Chen Lei <br> in the Proceedings of the International Conference on Computer Science and Network Technology (ICCSNT), December 2011, pp.430-433 <br><br> After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE’s Publication Principles. <br><br> This paper is a duplication of the original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission. <br><br> Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article: <br><br> “An Evolutionary Dynamic Population Size PSO Implementation” <br> by Bassel Soudan and Mohamed Saad <br> in the Proceedings of the 3rd International Conference on Information and Communication Technologies: From Theory to Applications (ICTTA), April 2008 <br><br> <br/> In this work we presented two dynamic population size improvements for the classical PSO. EP-PSO started with a small number of particles and increased the number of particles dynamically by iteratively duplicating the updated particles. DP-PSO started with a large number of particles then reduced the number by dropping the worst performing half iteratively. Both EP-PSO and DP-PSO reduced the execution time by 60% on average compared to the classical PSO. EP-PSO fared quite badly when convergence rate and convergence ability to the global optimum was considered. On the other hand, DP-PSO performed reasonably well compared to the classical PSO but at a much faster convergence and execution speed.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.