Abstract
To overcome premature searching by standard particle swarm optimization (PSO) algorithm for the large lost in population diversity, the measure of population diversity and its calculation are given, and an adaptive PSO with dynamically changing inertia weight is proposed. Simulation results show that the adaptive PSO not only effectively alleviates the problem of premature convergence, but also has fast convergence speed for balancing the trade-off between exploration and exploitation.
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.
