Abstract
Conventional Particle Swarm Optimization (PSO) algorithms often suffer premature convergences. Hybrid algorithms, for instance, the Simulated Annealing-based PSO, present low convergence speeds. In this paper, we develop an Adaptive Particle Swarm Optimization (APSO) algorithm to solve unconstrained global optimization problems with highly multimodal functions, in which two adaptive strategies (including an adaptive inertia weight strategy with hybrid time-varying dynamics and an adaptive random mutation strategy) are merged into the basic PSO algorithm to guarantee the algorithm performance. The proposed algorithm is numerically verified by fifteen classical multimodal functions which include Ackley, Bukin f6, Cross-in-Tray, Drop-Wave, Eggholder, Griewank, Holder Table, Langermann, Levy, Levy f13, Rastrigin, Schaffer f2, Schaffer f4, Schwefel, and Shubert. Numerical experiments demonstrate that the proposed algorithm has a potential to achieve better solutions with acceptable computational time, especially for high-dimensional optimization problems.
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.
