Abstract
© 2018 Elsevier B.V. The loss of coolant accident (LOCA) of a nuclear power plant (NPP) is a severe accident in the nuclear energy industry. Nowadays, neural networks have been trained on nuclear simulation transient datasets to detect LOCA. This paper proposes a constraint-based genetic algorithm (GA) to find optimised 2-hidden layer network architectures for detecting LOCA of a NPP. The GA uses a proposed constraint satisfaction algorithm called random walk heuristic to create an initial population of neural network architectures of high performance. At each generation, the GA population is split into a sub-population of feature subsets and a sub-population of 2-hidden layer architectures to breed offspring from each sub-population independently in order to generate a wide variety of network architectures. During breeding 2-hidden layer architectures, a constraint-based nearest neighbor search algorithm is proposed to find the nearest neighbors of the offspring population generated by mutation. The results showed that for LOCA detection, the GA-optimised network outperformed a random search, an exhaustive search and a RBF kernel support vector regression (SVR) in terms of generalization performance. For the skillcraft dataset of the UCI machine learning repository, the GA-optimised network has a similar performance to the RBF kernel SVR and outperformed the other approaches.
More Information
Identification Number: | https://doi.org/10.1016/j.neucom.2018.09.014 |
---|---|
Status: | Published |
Refereed: | Yes |
Publisher: | Elsevier |
Uncontrolled Keywords: | 08 Information And Computing Sciences, 09 Engineering, 17 Psychology And Cognitive Sciences, Artificial Intelligence & Image Processing, |
Depositing User (symplectic) | Deposited by Clark, Lucy on behalf of Tawfik, Hissam |
Date Deposited: | 09 Nov 2018 14:30 |
Last Modified: | 11 Jul 2024 07:44 |
Item Type: | Article |
Download
Note: this is the author's final manuscript and may differ from the published version which should be used for citation purposes.
License: Creative Commons Attribution Non-commercial No Derivatives
| Preview