To Build Digital Twin of Nuclear Reactor Decommissioning: Cutting and Packaging Method Based on Simulated Annealing Algorithm

The decommissioning of nuclear reactors is a worldwide problem because of process complex, high radioactive, high cost, leak of experience etc. Due to varying degrees of activation and radioactive nuclide contamination of the components within the nuclear reactor, appropriate treatment measures must be taken based on the radioactive levels of each component to ensure safe storage. The goal of this study is to design the cutting method for reactor components based on the dimensions of the solid waste packaging steel boxes to achieve optimal utilization of the cut blocks. For this specific purpose, a simulated annealing algorithm is adopted to optimize the packing of cut blocks, simplifying the complex three-dimensional irregular parts packing problem into a two-dimensional plane study to obtain the optimal number of cut blocks in each area of the reactor components. By determining the optimal number of cut blocks, a cutting plan is formulated, and a global packing plan for all cut blocks is derived. The research results show that this method can not only obtain the optimal cutting plan for different cutting areas of reactor components, but also determine the best placement of the cut blocks in the steel boxes while satisfying all cutting constraints. This method provides an effective solution for handling the cutting and packing issues during the decommissioning process of nuclear reactors and has potential for practical applications. This simulation and method will be applied to build of digital twin of nuclear reactor decommissioning.