Optimization of Rolling Schedule in Tandem Cold Mill Based on QPSO Algorithm

Article Preview

Abstract:

This paper adopts equal relatively load as objective function, and makes every parameter to meet certain restrictive conditions. SUMT algorithm was used to change constraints to non-binding conditions. QPSO algorithm was applied to optimize objective functions to obtain optimal solution. This algorithm was based on classical particle swarm optimization, which, with the conduct of quantum particle, had effective global search capability, good convergence and stability. As a result, reasonable distribution of tandem cold rolling power and full use of equipment capacity were realized, resulting in the improvement of production efficiency.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

165-170

Citation:

Online since:

October 2010

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] E. Brusa, L. Lemma: Numerical and experimental analysis of the dynamic effects in compact cluster mills for cold rolling. Journal of Materials Processing Technology, Vol. 209( 2009), No. 5, p.2436.

DOI: 10.1016/j.jmatprotec.2008.05.044

Google Scholar

[2] J. Kennedy, R.C. Eberhart: Particle swarm optimization. Proceedings of the 1995 IEEE International Conference on Neural Networks. (Piscataway, 1995). p.1942.

Google Scholar

[3] V.D. Bergh: An analysis of particle swarm optimization(Ph. D, Dissertation of University of Pretoria, Pretoria 2001).

Google Scholar

[4] J.G. Zhou, W.J. Li and J.B. Zhu: Particle swarm optimization computer simulation of Ni cluster. Transaction of Nonferrous Metals Society of China, (2008), No. 18, p.410.

DOI: 10.1016/s1003-6326(08)60072-2

Google Scholar

[5] H.S. Di, J.Z. Xu and Gong Dian-yao: Effect of load distribution on strip crown in hot string rolling. Master Sci Technol, Vol. 20(2004), No. 3, p.330.

Google Scholar

[6] C.T.A. Pires, H.C. Ferreira: Sales R M, et al. Set-up Optimization of Materials Processing Technology, Vol. 173(2006), p.368.

Google Scholar

[7] Y. Shen, C.A. Zeng: Self-organizing particle swarm optimization algorithm and application. Third International Conference on Natural Computation. ,Vol. 4(2007), p.668.

DOI: 10.1109/icnc.2007.137

Google Scholar

[8] M. Clerc, J. Kennedy: The particle swarm: explosion, stability and convergence in a multi-dimensional complex space. Evolutionary. Computation , Vol 6(2002), No. 1, p.58.

DOI: 10.1109/4235.985692

Google Scholar

[9] J. Sun, B. Feng and W.B. Xu: Particle swarm optimization with particles having quantum behavior. Proceedings of the IEEE Congress on Evolutionary Computation (Portland, USA, 2004). Vol. 6, p.576.

DOI: 10.1109/cec.2004.1330875

Google Scholar

[10] M.L. Xi, J. Sun and W.B. Xu: An improved quantum-behaved particle swarm optimization algorithm with weighted mean best position. Applied Mathematics and Computation, Vol. 205(2008), Issue 2, 15, p.751.

DOI: 10.1016/j.amc.2008.05.135

Google Scholar