کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5474889 | 1521095 | 2017 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
BEAVRS full core burnup calculation in hot full power condition by RMC code
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی انرژی
مهندسی انرژی و فناوری های برق
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Monte Carlo method can provide high fidelity neutronics analysis of different types of nuclear reactors, owing to its advantages of the flexible geometry modeling and the use of continuous-energy nuclear cross sections. However, nuclear reactors are complex systems with multi-physics interacting and coupling. MC codes can couple with depletion solver and thermal-hydraulics (T/H) codes simultaneously for the “transport-burnup-thermal-hydraulics” coupling calculations. MIT BEAVRS is a typical “transport-burnup-thermal-hydraulics” coupling benchmark. In this paper, RMC was coupled with sub-channel code COBRA, equipped with on-the-fly temperature-dependent cross section treatment and large-scale detailed burnup calculation based on domain decomposition. Then RMC was applied to the full core burnup calculations of BEAVRS benchmark in hot full power (HFP) condition. The numerical tests show that domain decomposition method can achieve the consistent results compared with original version of RMC while enlarging the computational burnup regions. The results of HFP by RMC agree well with the reference values of BEAVRS benchmark and also agree well with those of MC21. This work proves the feasibility and accuracy of RMC in multi-physics coupling and lifecycle simulations of nuclear reactors.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Annals of Nuclear Energy - Volume 101, March 2017, Pages 434-446
Journal: Annals of Nuclear Energy - Volume 101, March 2017, Pages 434-446
نویسندگان
Shichang Liu, Jingang Liang, Qu Wu, JuanJuan Guo, Shanfang Huang, Xiao Tang, Zeguang Li, Kan Wang,