Abstract
When a nuclear power reactor is shut down between successive operation cycles, refueling or reloading is needed. Devising a good refueling or reloading pattern is called "loading pattern optimization." It is a large, combinatorial optimization problem with a nonlinear objective function and nonlinear constraints. Algorithm based on a genetic algorithm (GA) was developed to generate optimized boiling water reactor (BWR) reloading patterns. The proposed algorithms are demonstrated in an actual BWR plant. In test calculations, candidates that shuffled fresh and burned fuel assemblies within a reasonable computation time were obtained.
| Original language | English |
|---|---|
| Pages | 383-390 |
| Number of pages | 8 |
| Publication status | Published - 2001 Dec 1 |
| Event | Proceedings of the 2001 IEEE International Symposium on Intelligent Control ISIC '01 - Mexico City, Mexico Duration: 2001 Sept 5 → 2001 Sept 7 |
Other
| Other | Proceedings of the 2001 IEEE International Symposium on Intelligent Control ISIC '01 |
|---|---|
| Country/Territory | Mexico |
| City | Mexico City |
| Period | 01/9/5 → 01/9/7 |
Keywords
- BWR
- Combinatorial problem
- GA
- Loading Pattern
ASJC Scopus subject areas
- Control and Systems Engineering
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering