An Improved Particle Swarm Optimization Algorithm Applied to the Unified Evaluation of Circularity Error

Abstract:

Minimum zone circle (MZC), minimum circumscribed circle (MCC), maximum inscribed circle (MIC) and least square circle (LSC) are four common methods used to evaluate circularity errors. A novel particle swarm optimization algorithm based on self-adapted comprehensive learning (ACL-PSO) is proposed to evaluate circularity errors with real coded strategy. In the algorithm, population learning mechanism and velocity mutation strategy are adopted. In the meantime, ACL-PSO is applied to the unified evaluation of circularity error. The experiment results evaluated by different methods indicate that the proposed algorithm not only converges to the global optimum rapidly, but also has good stability, and it is easy to generalize.

• Periodical: Applied Mechanics and Materials (Volumes 44-47)
• Pages: 3937-3941
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.44-47.3937
• Online since: December 2010
• Authors: Zhong Yong Wu, Jin Gou, Chang Cai Cui
• Keywords: Circularity Error, Evolutionary Strategy, Particle Swarm Optimization Algorithm (PSO), Population Centroid, Steepest Descent

References

[1] Kim N H, Kim S W. Geometrical tolerances: Improved linear approximation of least-squares evaluation of circularity by minimum variance. Int J Mach Tools & Manufact Vol. 36(1996), pp.355-366.

DOI: 10.1016/0890-6955(95)00056-9

[2] Elzinga J, Hearn D. The minimum covering sphere problem. Managem Sci Vol. 19(1972), pp.96-104.

DOI: 10.1287/mnsc.19.1.96

[3] Touissant G T. Computing largest empty circles with location constraints. Int J Comput & Information Sciences Vol. 12(1983), pp.347-358.

DOI: 10.1007/bf01008046

[4] Xiong Y L. Computer aided measurement of profile error of complex surfaces and curves: theory and algorithm. Int J Mach Tools & Manuf act Vol. 30(1990), pp.339-357.

DOI: 10.1016/0890-6955(90)90180-q

[5] Wen X L, Zhang P. Study on evolutionary strategy applied to the unified evaluation of circularity error. Act Metrologica Sinca Vol. 29(2008), pp.106-109.

[6] Zhu L M, Han D, Xiong Y L. A steepest descent algorithm for circularity evaluation. Comput Aided Des Vol. 35(2003), pp.255-265.

DOI: 10.1016/s0010-4485(01)00210-x

[7] Kennedy J, Eberhart R C. Particle swarm optimization. In: Proc. of the IEEE Internationa1 Conference on Neura1 Networks, Perth, Australia. 1995, p.1942-(1948).

[8] Clerc M, Kennedy J. The particle swarm: Explosion stability and convergence in a multi-dimensional complex space. IEEE Trans. on Evolutionary Computation Vol. 6(2002), pp.58-73.

DOI: 10.1109/4235.985692

[9] Trelea IC. The particle swarm optimization algorithm: Convergence analysis and parameter selection. Information Processing Letters Vol. 85(2003), pp.317-325.

DOI: 10.1016/s0020-0190(02)00447-7

[10] Sheng L S, Shu J L, Li K et al. Improved particle swarm cooperative optimization algorithm based on chaos & simplex method. In: Proc. of the IEEE International Conference Education Technology and Computer Science. 2010, pp.45-48.

DOI: 10.1109/etcs.2010.235

[11] Mu C H, Jiao L C, Liu Y. M-elite coevolutionary algorithm for numerical optimization. Journal of Software Vol. 20(2009), pp.2925-2938.

DOI: 10.3724/sp.j.1001.2009.03496