Research on Fitness Function of Two Evolution Algorithms Used for Neutron Spectrum Unfolding
Rui Li, Jianbo Yang, Xianguo Tuo, Rui Shi

TL;DR
This paper evaluates the performance of eight fitness functions in genetic and differential evolution algorithms for neutron spectrum unfolding, highlighting the importance of fitness function design and the potential of DEA.
Contribution
It systematically compares fitness functions for two evolution algorithms in neutron spectrum unfolding, providing insights for optimizing fitness function design.
Findings
Fitness functions with a maximum in GA limit population perception of fitness change.
Feature penalty terms improve solution performance.
DEA shows strong potential for neutron spectrum unfolding.
Abstract
When evolution algorithms are used to unfold the neutron energy spectrum, fitness function design is an important fundamental work for evaluating the quality of the solution, but it has not attracted much attention. In this work, we investigated the performance of eight fitness functions attached to the genetic algorithm (GA) and the differential evolution algorithm (DEA) used for unfolding four neutron spectra selected from the IAEA 403 report. Experiments show that the fitness functions with a maximum in the GA can limit the ability of the population to percept the fitness change, but the ability can be made up in the DEA. The fitness function with a feature penalty term helps to improve the performance of solutions, and the fitness function using the standard deviation and the Chi-squared result shows the balance between the algorithm and the spectra. The results also show that the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGenetic Algorithms
