用遗传算法求解中子能谱

Unfolding Neutron Spectrum Using Genetic Algorithm

  • 摘要: 由多球中子谱仪的响应矩阵和测量结果得到中子能谱属于少道解谱问题,存在多种可能解,因此,解谱过程是在解空间中寻找问题的最优解。遗传算法作为优化算法的一种,在求解这类问题上具有很大优势,通过基因操作,遗传算法可获得问题的全局最优解。本文根据中子能谱求解问题的特点,提出了一种新的适应度函数,它由1个距离项和1个惩罚项组成,距离项用于保证计算结果能够再现测量结果,惩罚项用于保证解的连续性,避免求解结果数据的剧烈变化。选择了5种具有代表性的能谱作为真实能谱,并将其与响应函数相乘后的结果作为模拟测量结果,用遗传算法求解的结果与真值符合较好,且能很好地再现模拟测量结果,表明了采用这种适应度函数的遗传算法在求解中子能谱中的可行性。

     

    Abstract: Derivation of neutron energy spectrum from multi-sphere neutron spectrometer’s experimental data is a kind of few channel problems, and therefore has more than one solution. Most unfolding methods try to search among the solution space to find the solution that best fit the measurement data and the response function. As a kind of optimization strategy, genetic algorithm could find the global optimal among the search space. Anew fitness function which contains a distance part and a penalty part was constructed in this research. The distance part is the square distance between the individual and the measurement data. The penalty part which is a function associated with the continuityof individual was used to avoid intensively change of unfolded data. Five classical neutron spectra were chosen as benchmark spectra. Theresults of the benchmark spectra multiplied by the response function were acted as input measurement data of the unfolding program.Unfolded results show that they are well agreeable with the true spectra, proven the feasibility of unfolding neutron spectrum using genetic algorithm.

     

/

返回文章
返回