Abstract
Particle Swarm Optimization (PSO), which has attracted a great deal of attention as a global optimization method in recent years, has a drawback in that its continuous search based on its excellent dynamic characteristics can not be executed stably until the end of computation due to its much strong convergence trend. In this paper, we propose “Repetitive Search Guideline” which differs from a common guideline in the improved methods which have ever been proposed and by which the continuous search of PSO is achieved without lack of PSO's excellent dynamic characteristics due to the repetitive search in a promise area where objective function value is expected to be small. We consider four improved methods based on the proposed guideline, and then, their effectiveness are confirmed through applications to 100 variables multi-peaked benchmark problems.
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 callMore From: IEEJ Transactions on Electronics, Information and Systems
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.
