Application of genetic algorithms to strip hot rolling scheduling

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents an application of a genetic algorithm (GA) to the scheduling of hot rolling mills. The objective function used is based on earlier developments on flow stress modeling of steels. A hybrid two-phase procedure was applied in order to calculate the optimal pass reductions, in terms of minimum total rolling time. In the first phase, a non-linear optimization function was applied to evaluate the computational cost to the problem solution. For the second phase, a GA was applied. A comparison with two-point and simulated binary (SBX) crossover operators was established. The results were validated with data of industrial schedules. A GA with SBX crossover operator is shown to be an efficient method to calculate the multi-pass schedules at reduced processing time. © 2007 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hernández Carreón, C. A., Fraire Huacuja, H. J., Fernandez, K. E., Valdez, G. C., & Mancilla Tolama, J. E. (2007). Application of genetic algorithms to strip hot rolling scheduling. In Advances in Soft Computing (Vol. 44, pp. 247–254). https://doi.org/10.1007/978-3-540-74972-1_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free