https://scholars.lib.ntu.edu.tw/handle/123456789/598999
標題: | Metaheuristic minimum dose path planning for nuclear power plant decommissioning | 作者: | Lai Y.-C Smith S. SHANA SMITH |
關鍵字: | Genetic algorithm;Metaheuristic;Minimum dose path planning;Particle swarm optimization;Biomimetics;Decommissioning (nuclear reactors);Genetic algorithms;Motion planning;Nuclear energy;Nuclear fuels;Nuclear power plants;Decommissioning strategies;Grid-based;Meta-heuristic methods;Operational life;Optimal paths;Power plant decommissioning;Radioactive environment;Workers';Particle swarm optimization (PSO) | 公開日期: | 2022 | 卷: | 166 | 來源出版物: | Annals of Nuclear Energy | 摘要: | When a nuclear power plant reaches its end of operational life, decommissioning work needs to be carried out. One of the most important decommissioning strategies is to plan an optimal path for workers or robots to move around in a radioactive environment, keeping the radiation exposure as low as possible. This paper develops two bio-inspired metaheuristic methods for minimum dose path planning using a particle swarm optimization (PSO) algorithm and a genetic algorithm (GA), respectively. To evaluate the effectiveness of the two metaheuristic methods, two extreme hypothetical environments are simulated. The developed bio-inspired metaheuristic methods are compared with prior grid-based and sampling-based minimum dose path planning algorithms, in terms of cumulative dose, computational time, and distance. The results indicate that PSO outperforms prior grid-based and sampling-based algorithms in cumulative dose and distance. GA outperforms only the grid-based algorithms in cumulative dose and distance. ? 2021 Elsevier Ltd |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85119266674&doi=10.1016%2fj.anucene.2021.108800&partnerID=40&md5=61d9dea97897d2ff3926fc8de647ca92 https://scholars.lib.ntu.edu.tw/handle/123456789/598999 |
ISSN: | 03064549 | DOI: | 10.1016/j.anucene.2021.108800 |
顯示於: | 機械工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。