R.J. Scholman
Please Note
4 records found
1
The publisher would like to apologise for any inconvenience caused. ...
The publisher would like to apologise for any inconvenience caused.
PURPOSE: Without a clear definition of an optimal treatment plan, no optimization model can be perfect. Therefore, instead of automatically finding a single “optimal” plan, finding multiple, yet different near-optimal plans, can be an insightful approach to support radiation oncologists in finding the plan they are looking for. METHODS AND MATERIALS: BRIGHT is a flexible AI-based optimization method for brachytherapy treatment planning that has already been shown capable of finding high-quality plans that trade-off target volume coverage and healthy tissue sparing. We leverage the flexibility of BRIGHT to find plans with similar dose-volume criteria, yet different dose distributions. We further describe extensions that facilitate fast plan adaptation should planning aims need to be adjusted, and straightforwardly allow incorporating hospital-specific aims besides standard protocols. RESULTS: Results are obtained for prostate (n = 12) and cervix brachytherapy (n = 36). We demonstrate the possible differences in dose distribution for optimized plans with equal dose-volume criteria. We furthermore demonstrate that adding hospital-specific aims enables adhering to hospital-specific practice while still being able to automatically create cervix plans that more often satisfy the EMBRACE-II protocol than clinical practice. Finally, we illustrate the feasibility of fast plan adaptation. CONCLUSIONS: Methods such as BRIGHT enable new ways to construct high-quality treatment plans for brachytherapy while offering new insights by making explicit the options one has. In particular, it becomes possible to present to radiation oncologists a manageable set of alternative plans that, from an optimization perspective are equally good, yet differ in terms of coverage-sparing trade-offs and shape of the dose distribution.
Even if a Multi-modal Multi-Objective Evolutionary Algorithm (MMOEA) is designed to find solutions well spread over all locally optimal approximation sets of a Multi-modal Multi-objective Optimization Problem (MMOP), there is a risk that the found set of solutions is not smoothly navigable because the solutions belong to various niches, reducing the insight for decision makers. To tackle this issue, a new MMOEAs is proposed: the Multi-Modal Bézier Evolutionary Algorithm (MM-BezEA), which produces approximation sets that cover individual niches and exhibit inherent decision-space smoothness as they are parameterized by Bézier curves. MM-BezEA combines the concepts behind the recently introduced BezEA and MO-HillVallEA to find all locally optimal approximation sets. When benchmarked against the MMOEAs MO_Ring_PSO_SCD and MO-HillVallEA on MMOPs with linear Pareto sets, MM-BezEA was found to perform best in terms of best hypervolume.