Particle swarm optimization algorithm is a stochastic global optimization algorithm, inertia weight is one of its important parameters, in order to improve its easy to fall into the defects of local optimization and precocious maturity, this paper proposes a new dynamic weight particle swarm optimization algorithm. The new algorithm designs a dynamic weight based on the global optimal solution and its own optimal solution, which makes the velocity change of particles more reasonable, applies it to the classical test function, accelerates the convergence speed, and effectively improves the difficulty of falling into local optimum, and improves the global search ability.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.