Abstract
Scalability of the multi-guide particle swarm optimization (MGPSO) algorithm to many objective optimization problems is investigated in this paper. As a sub-objective, the effects of different archive balance coefficient update strategies on the scaling ability of the MGPSO algorithm are investigated. The results indicate that the MGPSO algorithm scaled to many-objectives competitively compared to other state-of-the-art many-objective optimization algorithms, without requiring any specialized modifications to the MGPSO algorithm. The MGPSO algorithm utilizes multiple subswarms (one per objective) as well as multiple guides (personal best, neighbourhood best, and archive guides) to help balance and promote solution accuracy and solution diversity during the search process. The investigated dynamic archive balance coefficient update strategies did not improve the scalability of the MGPSO algorithm significantly.
Sign-in/Register to access full text options 
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.
