{"title":"基于全局效率指标最大化的全局理货问题蒙特卡罗加权窗口生成器","authors":"Xian Zhang , Shu Li , Xin Wang , DanHua ShangGuan","doi":"10.1016/j.jcp.2025.114383","DOIUrl":null,"url":null,"abstract":"<div><div>Weight window method is powerful in seeking precise global tallies or single target tally of particle transport problems within a reasonable time cost when its parameters are suitable. But how to get excellent parameters is not trivial, especially for complex transport models. Various strategies are proposed to set numerous parameters of this method based on various considerations. But this challenging problem is still open for new exploration despite all the progress which have been achieved. This paper aims to solve the global tallying problem, which is more difficult in the vast majority of all cases, by a novel weight window generator which supplies excellent parameters of weight window method. This generator relies on the maximization of global efficiency indicator and a natural adaptive strategy. The efficiency and reliability of this generator are validated on the Winfrith Water benchmark and AP1000 full-core model, respectively. Compared to the classical MAGIC method, this proposed method can enhance global efficiency by 2-3 times magnitude when measured by the same global efficiency indicator.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"542 ","pages":"Article 114383"},"PeriodicalIF":3.8000,"publicationDate":"2025-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Novel Monte Carlo weight window generator for global tallying problems based on maximization of global efficiency indicator\",\"authors\":\"Xian Zhang , Shu Li , Xin Wang , DanHua ShangGuan\",\"doi\":\"10.1016/j.jcp.2025.114383\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Weight window method is powerful in seeking precise global tallies or single target tally of particle transport problems within a reasonable time cost when its parameters are suitable. But how to get excellent parameters is not trivial, especially for complex transport models. Various strategies are proposed to set numerous parameters of this method based on various considerations. But this challenging problem is still open for new exploration despite all the progress which have been achieved. This paper aims to solve the global tallying problem, which is more difficult in the vast majority of all cases, by a novel weight window generator which supplies excellent parameters of weight window method. This generator relies on the maximization of global efficiency indicator and a natural adaptive strategy. The efficiency and reliability of this generator are validated on the Winfrith Water benchmark and AP1000 full-core model, respectively. Compared to the classical MAGIC method, this proposed method can enhance global efficiency by 2-3 times magnitude when measured by the same global efficiency indicator.</div></div>\",\"PeriodicalId\":352,\"journal\":{\"name\":\"Journal of Computational Physics\",\"volume\":\"542 \",\"pages\":\"Article 114383\"},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2025-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Physics\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021999125006655\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Physics","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021999125006655","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Novel Monte Carlo weight window generator for global tallying problems based on maximization of global efficiency indicator
Weight window method is powerful in seeking precise global tallies or single target tally of particle transport problems within a reasonable time cost when its parameters are suitable. But how to get excellent parameters is not trivial, especially for complex transport models. Various strategies are proposed to set numerous parameters of this method based on various considerations. But this challenging problem is still open for new exploration despite all the progress which have been achieved. This paper aims to solve the global tallying problem, which is more difficult in the vast majority of all cases, by a novel weight window generator which supplies excellent parameters of weight window method. This generator relies on the maximization of global efficiency indicator and a natural adaptive strategy. The efficiency and reliability of this generator are validated on the Winfrith Water benchmark and AP1000 full-core model, respectively. Compared to the classical MAGIC method, this proposed method can enhance global efficiency by 2-3 times magnitude when measured by the same global efficiency indicator.
期刊介绍:
Journal of Computational Physics thoroughly treats the computational aspects of physical problems, presenting techniques for the numerical solution of mathematical equations arising in all areas of physics. The journal seeks to emphasize methods that cross disciplinary boundaries.
The Journal of Computational Physics also publishes short notes of 4 pages or less (including figures, tables, and references but excluding title pages). Letters to the Editor commenting on articles already published in this Journal will also be considered. Neither notes nor letters should have an abstract.