mlsanityData to 14 Oct 2026

Multi-Objective Reinforcement Learning-based Approach for Pressurized Water Reactor Optimization

arXiv 2312.10194 ↗First posted 15 Dec 2023cs.LG cs.CEcited by 5

Not on the map. Why?

Abstract (arXiv)

A novel method, the Pareto Envelope Augmented with Reinforcement Learning (PEARL), has been developed to address the challenges posed by multi-objective problems, particularly in the field of engineering where the evaluation of candidate solutions can be time-consuming. PEARL distinguishes itself from traditional policy-based multi-objective Reinforcement Learning methods by learning a single policy, eliminating the need for multiple neural networks to independently solve simpler sub-problems. Several versions inspired from deep learning and evolutionary techniques have been crafted, catering to both unconstrained and constrained problem domains. Curriculum Learning is harnessed to effectively manage constraints in these versions. PEARL's performance is first evaluated on classical multi-objective benchmarks. Additionally, it is tested on two practical PWR core Loading Pattern optimization problems to showcase its real-world applicability. The first problem involves optimizing the Cycle length and the rod-integrated peaking factor as the primary objectives, while the second problem incorporates the mean average enrichment as an additional objective. Furthermore, PEARL addresses three types of constraints related to boron concentration, peak pin burnup, and peak pin power. The results are systematically compared against conventional approaches. Notably, PEARL, specifically the PEARL-NdS variant, efficiently uncovers a Pareto front without necessitating additional efforts from the algorithm designer, as opposed to a single optimization with scaled objectives. It also outperforms the classical approach across multiple performance metrics, including the Hyper-volume.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 15 of its 60 references that are in the map. First posted on arXiv 15 Dec 2023.

Builds on

15 of 60 references.

References · 15

  1. 2015Trust Region Policy Optimizationcited by 2,580
  2. 2016Progressive Neural Networkscited by 1,361
  3. 2017Constrained Policy Optimizationcited by 983
  4. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 623
  5. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 561
  6. 2020Reinforcement Learning for Combinatorial Optimization: A Surveycited by 236
  7. 2020pymoo: Multi-objective Optimization in Pythoncited by 200
  8. 2019A Generalized Algorithm for Multi-Objective Reinforcement Learning and Policy Adaptationcited by 177
  9. 2021End-to-End Constrained Optimization Learning: A Surveycited by 157
  10. 2016Multi-Objective Deep Reinforcement Learningcited by 83
  11. 2019Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learningcited by 78
  12. 2022Redeeming Intrinsic Rewards via Constrained Optimizationcited by 24
3 more
  1. 2020Constrained Combinatorial Optimization with Reinforcement Learningcited by 8
  2. 2023Assessment of Reinforcement Learning Algorithms for Nuclear Power Plant Fuel Optimizationcited by 5
  3. 2021Multi-Objective Reinforcement Learning based Multi-Microgrid System Optimisation Problemcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 2.

5 papers.