Two Effective Heuristics for Beam Angle Optimization in Radiation Therapy
Hamed Yarmand, David Craft

TL;DR
This paper introduces two novel heuristics to significantly reduce computation time in beam angle optimization for radiation therapy, maintaining high solution quality in complex clinical cases.
Contribution
The paper presents two new heuristic methods, based on adjacent beam cuts and beam elimination, to improve efficiency in large-scale radiation therapy optimization problems.
Findings
Heuristics reduce computation time substantially.
High-quality solutions are maintained with the heuristics.
Effective in clinical liver case studies.
Abstract
In radiation therapy, mathematical methods have been used for optimizing treatment planning for delivery of sufficient dose to the cancerous cells while keeping the dose to critical surrounding structures minimal. This optimization problem can be modeled using mixed integer programming (MIP) whose solution gives the optimal beam orientation as well as optimal beam intensity. The challenge, however, is the computation time for this large scale MIP. We propose and investigate two novel heuristic approaches to reduce the computation time considerably while attaining high-quality solutions. We introduce a family of heuristic cuts based on the concept of 'adjacent beams' and a beam elimination scheme based on the contribution of each beam to deliver the dose to the tumor in the ideal plan in which all potential beams can be used simultaneously. We show the effectiveness of these heuristics…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
