The identification of possible transients in a nucl ear power plant is a highly relevant problem. This is mainly due to the fact that the operation of a n uclear power plant involves a large number of state variables whose behaviors are extremely dynamic. In risk situations, besides the huge cognitive overload that operators are submitted to, there is also the problem related with the considerable decrease in the effective time for cor rect decision making. To minimize these problems and help operators to make the corrective actions in due time, this paper presents a new contribution in this area and introduces an experim ental transient identification system based exclusively on the abilities of the Discrete Binary Artificial Bee Colony (DBABC) algorithm to find the best centroid positions that correctly ide ntifies a transient in a nuclear power plant. The DBABC is a reworking of the Artificial Bee Colony (ABC) algorithm which presents the advantage of operating in both continuous and discr ete search spaces. Through the analysis of experimental results, the effective performance of the proposed DBABC algorithm is shown against some well known best performing algorithms from the literature.
[1]
David E. Goldberg,et al.
Genetic Algorithms in Search Optimization and Machine Learning
,
1988
.
[2]
R. Schirru,et al.
GENETIC BASED TRANSIENT IDENTIFICATION SYSTEM DESIGN WITH AUTOMATIC SELECTION OF MEANINGFUL VARIABLES
,
2002
.
[3]
Roberto Schirru,et al.
Identification of nuclear power plant transients using the Particle Swarm Optimization algorithm
,
2008
.
[4]
Roberto Schirru,et al.
ON THE PERFORMANCE OF AN ARTIFICIAL BEE COLONY OPTIMIZATION ALGORITHM APPLIED TO THE ACCIDENT DIAGNOSIS IN A PWR NUCLEAR POWER PLANT
,
2009
.
[5]
Dervis Karaboga,et al.
AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION
,
2005
.