Skip to main navigation Skip to search Skip to main content

Application of homogenous continuous Ant Colony Optimization algorithm to inverse problem of one-dimensional coupled radiation and conduction heat transfer

  • Biao Zhang
  • , Hong Qi*
  • , Ya Tao Ren
  • , Shuang Cheng Sun
  • , Li Ming Ruan
  • *Corresponding author for this work
  • School of Energy Science and Engineering, Harbin Institute of Technology

Research output: Contribution to journalArticlepeer-review

Abstract

In this study, a grid-based continuous Ant Colony Optimization (ACO) algorithm was applied to the inverse problem of a one-dimensional (1-D) coupled radiation and conduction heat transfer. To overcome the local convergence of the Basic Ant Colony Optimization (BACO) algorithm for continuous domain problems, a Homogenous Ant Colony Optimization (HACO) algorithm was developed. To illustrate the performances of these algorithms, the thermal conductivity, absorption coefficient and scattering coefficient of the 1-D homogeneous semi-transparent medium were retrieved for four test cases. The sensitivity coefficient with respect to the inversion parameters was analyzed, on the basis of which the objective function was designed. The temperature and radiative heat flux simulated by the Finite Volume Method (FVM) were served as input for the inverse analysis. The HACO algorithm was demonstrated to be effective and robust, which has the potential to be implemented in various inverse heat transfer problems.

Original languageEnglish
Pages (from-to)507-516
Number of pages10
JournalInternational Journal of Heat and Mass Transfer
Volume66
DOIs
StatePublished - 2013
Externally publishedYes

Keywords

  • Ant Colony Optimization
  • Coupled radiation and conduction heat transfer
  • Inverse problem

Fingerprint

Dive into the research topics of 'Application of homogenous continuous Ant Colony Optimization algorithm to inverse problem of one-dimensional coupled radiation and conduction heat transfer'. Together they form a unique fingerprint.

Cite this