抄録
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.
本文言語 | English |
---|---|
ページ | 383-390 |
ページ数 | 8 |
出版ステータス | Published - 2001 12月 1 |
イベント | Proceedings of the 2001 IEEE International Symposium on Intelligent Control ISIC '01 - Mexico City, Mexico 継続期間: 2001 9月 5 → 2001 9月 7 |
Other
Other | Proceedings of the 2001 IEEE International Symposium on Intelligent Control ISIC '01 |
---|---|
国/地域 | Mexico |
City | Mexico City |
Period | 01/9/5 → 01/9/7 |
ASJC Scopus subject areas
- 制御およびシステム工学
- モデリングとシミュレーション
- コンピュータ サイエンスの応用
- 電子工学および電気工学