By Topic

Critical heat flux function approximation using genetic algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yung-Keun Kwon ; Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., South Korea ; Byung-Ro Moon ; Sung-Deok Hong

Function approximation is the problem of finding a system that best explains the relationship between input variables and an output variable. We propose two hybrid genetic algorithms (GAs) of parametric and nonparametric models for function approximation. The former GA is a genetic nonlinear Levenberg-Marquardt algorithm of parametric model. We designed the chromosomes in a way that geographically exploits the relationships between parameters. The latter one is another GA of nonparametric model that is combined with a feedforward neural network. The neuro-genetic hybrid here differs from others in that it evolves diverse input features instead of connection weights. We tested the two GAs with the problem of finding a better critical heat flux (CHF) function of nuclear fuel bundle which is directly related to the nuclear-reactor thermal margin and operation. The experimental result improved the existing CHF function originated from the KRB-1 CHF correlation at the Korea Atomic Energy Research Institute (KAERI) and achieved the correlation uncertainty reduction of 15.4% that would notably contribute to increasing the thermal margin of the nuclear power plants.

Published in:

Nuclear Science, IEEE Transactions on  (Volume:52 ,  Issue: 2 )