2018
DOI: 10.1093/imaman/dpy014
|View full text |Cite
|
Sign up to set email alerts
|

Development and evaluation of a matheuristic for the combined beam angle and dose distribution problem in radiotherapy planning

Abstract: Radiotherapy planning is vital for ensuring the maximum level of effectiveness of treatment. In the planning task, there are at least two connected decision problems that can be modelled and solved using operational research techniques: determining the best position of the radiotherapy machine (beam angle problem) and the optimal dose delivered through each beam (dose distribution problem). This paper presents a mathematical optimization model for solving the combined beam angle and dose distribution problems … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…(2005), a particle swarm algorithm is proposed to select a beam ensemble with five beams, obtained from a 10$10^{\circ }$ gantry angle spacing set. Other approaches include matheuristics based on tabu search (Obal et al., 2018), hybrid approaches (Bertsimas et al., 2013), branch and prune (Lim and Cao, 2012), neighborhood search (Aleman et al., 2008), and gradient search (Craft, 2007). In our previous works, the optimal value of the FMO function has been used to guide the highly non‐convex BAO problem, which is addressed using derivative‐free algorithms (Rocha et al., 2013a, 2013b, 2013c; Dias et al., 2014, 2015; Rocha et al., 2016, 2019; Carrasqueira et al., 2023).…”
Section: Bi‐level Optimization For Imrtmentioning
confidence: 99%
“…(2005), a particle swarm algorithm is proposed to select a beam ensemble with five beams, obtained from a 10$10^{\circ }$ gantry angle spacing set. Other approaches include matheuristics based on tabu search (Obal et al., 2018), hybrid approaches (Bertsimas et al., 2013), branch and prune (Lim and Cao, 2012), neighborhood search (Aleman et al., 2008), and gradient search (Craft, 2007). In our previous works, the optimal value of the FMO function has been used to guide the highly non‐convex BAO problem, which is addressed using derivative‐free algorithms (Rocha et al., 2013a, 2013b, 2013c; Dias et al., 2014, 2015; Rocha et al., 2016, 2019; Carrasqueira et al., 2023).…”
Section: Bi‐level Optimization For Imrtmentioning
confidence: 99%