Abstract
Particle Swarm Optimization (PSO) is having a growing space in the optimization community, mainly due to its appreciable qualities of fast initial progress, reduced computational cost and parallel structure, suitable for High Performance Computation (HPC) platforms. Original formulation includes some random coecients, so that a statistical analysis of the solution is often needed. To avoid the latter situation, Deterministic Particle Swarm Optimization (DPSO) has been introduced: removing all the random coecients the DPSO is a deterministic algorithm, so that a single run is considered to evaluate the success of the algorithm. In this paper, a comparative study between PSO and DPSO is reported, in order to investigate the performance of DPSO versus PSO.
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 callDisclaimer: 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.
