ON THE METAHEURISTIC OPTIMIZATION ALGORITHMS IN THE STRUGGLE FOR THE HOT FLOW CURVE APPROXIMATION ACCURACY

1 OPĚLA Petr
Co-authors:
1 SCHINDLER Ivo 1 RUSZ Stanislav 1 ŠEVČÁK Vojtěch 2 MAMUZIC Ilija
Institutions:
1 VSB – Technical University of Ostrava, Ostrava, Czech Republic, EU, petr.opela@vsb.cz
2 Faculty of Metallurgy, University of Zagreb, Sisak, Croatia
Conference:
29th International Conference on Metallurgy and Materials, Brno, Czech Republic, EU, May 20 - 22, 2020
Proceedings:
Proceedings 29th International Conference on Metallurgy and Materials
Pages:
308-314
ISBN:
978-80-87294-97-0
ISSN:
2694-9296
Published:
27th July 2020
Proceedings of the conference were published in Web of Science and Scopus.
Metrics:
769 views / 336 downloads
Abstract

A hot flow curve approximation performed via flow stress models as well as artificial neural networks requires precisely estimated constants. This estimation is in the case of highly-nonlinear issues often solved via gradient optimization algorithms. Nevertheless, by natural processes or physical laws inspired approaches (metaheuristic algorithms) are also of high interest. In the submitted manuscript, three selected metaheuristic algorithms were compared under the approximation of an experimental hot flow curve dataset via the well-known Hensel-Spittel relationship. One often used gradient algorithm was also included into this comparison. Results have showed that the metaheuristic algorithms are useful if such complex approximation model is applied and no estimate of material constants from a previous approximation issue is used. On the other hand, if this estimation exists, the gradient algorithms should provide a better solution.

Keywords: Hot-flow-curve approximation, genetic algorithm, artificial bee colony, fish swarm algorithm

© This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Scroll to Top