Processing Parameters Optimization Based on PSO Algorithm

Article Preview

Abstract:

Particle swarm optimization (PSO) is classified into swarm intelligence algorithm. Focusing on the NC processing parameters optimization, this paper has made several improvements on PSO: dividing solutions into feasible and infeasible, then shrinking the infeasible solutions; dividing feasible solutions into inferior and non-inferior, then choosing the non-inferior solution with most domination solutions as the global best position for inferior solutions. It has shown a significant achievement in actual processing.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

419-423

Citation:

Online since:

November 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] L. Wang, B. Liu: Particle Swarm Optimization and Scheduling Algorithm (Tsinghua University Press, Beijing 2008).

Google Scholar

[2] S. Gao, J. Y Wang: Swarm Intelligence Algorithm (China Water Power Press, China 2006).

Google Scholar

[3] J. C Zeng, J. Jie, Z.H. Chui: Particle Swarm optimization (Science Press, Beijing 2004).

Google Scholar

[4] Runarsson T.P., Yao X: IEEE Trans. on Evolutionary Computation Vol. 4 (2000), pp.284-294.

Google Scholar

[5] Deb K: Computer Methods in Applied Mechanics and Engineering Vol. 186 (2000), pp.311-339.

Google Scholar

[6] X.K. Wang: Mechanical processing handbook (China Machine Press, Beijing2007).

Google Scholar

[7] K.E. Parsopoulos and M.N. Vrahatis: Applied Computing (Madrid, Spain, March 11-14, 2002).

Google Scholar

[8] M. Clerc: Evolutionary Computation (Washington DC, USA, July 6-9, 1999).

Google Scholar