Abstract

More and more occupational workers work in radioactive environment. Although measures are taken to keep the radiation dose in a safe range, the workers will suffer more radiation during the overhauling of nuclear power plants. The dose they suffer during the overhauling of nuclear power plants account for 80% of the total annual dose so it is necessarily to plan a reasonable inspection path for them according to the safety principle of as low as reasonably achievable (ALARA). An improved ant colony optimization (IACO) algorithm is proposed to solve the multi-objective inspection path-planning problem in radioactive environment. To improve the performance of the algorithm, we not only combine ant colony optimization (ACO) algorithm and chaos optimization algorithm, but also introduce pheromone differentiated update strategy and local search optimization strategy. Additionally, 5 experimental simulation cases are conducted and the results are compared to those from particle swarm optimization (PSO) algorithm, chaos particle swarm optimization (CPSO) algorithm and tradition ACO algorithm. In the first three cases, the probability of IACO algorithm finding the optimal path is obviously greater than that of PSO algorithm and CPSO algorithm. IACO algorithm is more efficient and stable. By analyzing an inspection path-planning case with 35 target positions and a case with 44 target positions in a more complex radioactive environment, IACO algorithm could find the path with less effective dose that ACO algorithm cannot find. Therefore, the effectiveness and validity of IACO to solve multi-objective inspection path-planning problem in radioactive environment are verified by experimental simulations and it can help workers reduce radiation exposure.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.