Research on particle swarm optimization algorithm based on optimal movement probability

Jianhong Ma; Han Zhang; Baofeng He

doi:10.1117/12.2265257

23 January 2017 Research on particle swarm optimization algorithm based on optimal movement probability

Jianhong Ma, Han Zhang, Baofeng He

Proceedings Volume 10322, Seventh International Conference on Electronics and Information Engineering; 103222A (2017) https://doi.org/10.1117/12.2265257
Event: Seventh International Conference on Electronics and Information Engineering, 2016, Nanjing, China

Abstract

The particle swarm optimization algorithm to improve the control precision, and has great application value training neural network and fuzzy system control fields etc.The traditional particle swarm algorithm is used for the training of feed forward neural networks,the search efficiency is low, and easy to fall into local convergence.An improved particle swarm optimization algorithm is proposed based on error back propagation gradient descent. Particle swarm optimization for Solving Least Squares Problems to meme group, the particles in the fitness ranking, optimization problem of the overall consideration, the error back propagation gradient descent training BP neural network, particle to update the velocity and position according to their individual optimal and global optimization, make the particles more to the social optimal learning and less to its optimal learning, it can avoid the particles fall into local optimum, by using gradient information can accelerate the PSO local search ability, improve the multi beam particle swarm depth zero less trajectory information search efficiency, the realization of improved particle swarm optimization algorithm. Simulation results show that the algorithm in the initial stage of rapid convergence to the global optimal solution can be near to the global optimal solution and keep close to the trend, the algorithm has faster convergence speed and search performance in the same running time, it can improve the convergence speed of the algorithm, especially the later search efficiency.

Citation Download Citation

Jianhong Ma, Han Zhang, and Baofeng He "Research on particle swarm optimization algorithm based on optimal movement probability", Proc. SPIE 10322, Seventh International Conference on Electronics and Information Engineering, 103222A (23 January 2017); https://doi.org/10.1117/12.2265257

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

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.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
6 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Particles

Particle swarm optimization

Evolutionary algorithms

Neural networks

Control systems

Algorithm development

Detection and tracking algorithms

Show All Keywords

Keywords/Phrases

Search In:

Publication Years