Abstract
We propose a basic method for finding multiple optimal solutions by using a modified Particle Swarm Optimization (PSO) algorithm which utilizes the distribution of personal bests (pbests). The proposed method has the following features: (a) global search for multiple optimal solutions sequentially by using a modified PSO algorithm, called “main-PSO,” in which the global best (gbest) is replaced by the personal best (pbest) of another particle in order to gather pbests in a self-organizing manner; (b) prediction of the attracting region of optimal solutions by analyzing the distribution of pbests in terms of the distance in the search space and the objective space; (c) local search for an accurate optimal solution in the predicted region intensively by using a standard PSO algorithm, called “sub-PSO”; and, (d) exclusion of locally searched regions from the original search domain in order to improve the efficiency of global search. By numerical experiments, we study its ability to find global and local optimal solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.