Qualitative and quantitative performance comparison of recent optimization algorithms for economic optimization of the heat exchangers

No Thumbnail Available

Date

2020-09-09

Journal Title

Journal ISSN

Volume Title

Publisher

Springer

Abstract

Solving applied problem of economic optimization is considered as a real test for the optimization algorithms. The present work explores the qualitative and quantitative comparative analysis of nine recently developed optimization algorithms for the economic optimization of the heat exchangers. Passing vehicle search, Salp swarm algorithm, Artificial flora optimization, Grey wolf optimizer, Electro-search algorithm, Grasshopper optimisation algorithm, Symbiotic organisms search, Ant lion optimizer, and Heat transfer search algorithm are considered in the present work. Shell and tube, plate-fin, and fin-tube heat exchanger are considered for the optimization. Statistical analyses of the results are carried out to identify the significant between the results of comparative algorithms. The effect of various constraint handling techniques on the performance of the algorithms is identify and presented. Economically optimized geometry of each of the heat exchanger is presented in detail. Finally, the convergence of the considered algorithm in obtaining the minimum total cost solutions are also presented and discussed.

Description

Keywords

Many-objective optimization, Design optimization, Genetic algorithms, Search, Evolutionary, Computer science, Engineering, Mathematics, Constrained optimization, Heat transfer, Learning algorithms, Comparative analysis, Constraint-handling techniques, Economic optimization, Fin-tube heat exchangers, Optimization algorithms, Optimized geometries, Performance comparison, Search algorithms, Fins (heat exchange)

Citation

Patel, V. vd. (2020). "Qualitative and quantitative performance comparison of recent optimization algorithms for economic optimization of the heat exchangers". Archives of Computational Methods in Engineering, 28(4), 2881-2896.