Open Access

ARTICLE

Application of Metaheuristic Algorithms for Optimizing Longitudinal Square Porous Fins

Samer H. Atawneh¹, Waqar A. Khan², Nawaf N. Hamadneh^3,*, Adeeb M. Alhomoud³

1 College of Computing and Informatics, Saudi Electronic University, Riyadh, 11673, Saudi Arabia
2 Department of Mechanical Engineering, College of Engineering, Prince Mohammad bin Fahd University, Al Khobar, 31952, Saudi Arabia
3 Department of Basic Sciences, College of Science and Theoretical Studies, Saudi Electronic University, Riyadh, 11673, Saudi Arabia

* Corresponding Author: Nawaf N. Hamadneh. Email:

Computers, Materials & Continua 2021, 67(1), 73-87. https://doi.org/10.32604/cmc.2021.012351

Received 27 June 2020; Accepted 25 July 2020; Issue published 12 January 2021

Abstract

The objectives of this study involve the optimization of longitudinal porous fins of square cross-section using metaheuristic algorithms. A generalized nonlinear ordinary differential equation is derived using Darcy and Fourier’s laws in the energy balance around a control volume and is solved numerically using RFK 45 method. The temperature of the base surface is higher than the fin surface, and the fin tip is kept adiabatic or cooled by convection heat transfer. The other pertinent parameters include Rayleigh number (100 ≤ Ra ≤ 10⁴), Darcy number, (10⁻⁴ ≤ Da ≤ 10⁻²), relative thermal conductivity ratio of solid phase to fluid (1000 ≤ k_r ≤ 8000), Nusselt number (10 ≤ Nu ≤ 100), porosity (0.1 ≤ φ ≤ 0.9). The impacts of these parameters on the entropy generation rate are investigated and optimized using metaheuristic algorithms. In computer science, metaheuristic algorithms are one of the most widely used techniques for optimization problems. In this research, three metaheuristic algorithms, including the firefly algorithm (FFA), particle swarm algorithm (PSO), and hybrid algorithm (FFA-PSO) are employed to examine the performance of square fins. It is demonstrated that FFA-PSO takes fewer iterations and less computational time to converge compared to other algorithms.

---

Keywords

---

Citations