2009
DOI: 10.1287/ijoc.1080.0297
|View full text |Cite
|
Sign up to set email alerts
|

Solving Beam-Angle Selection and Dose Optimization Simultaneously via High-Throughput Computing

Abstract: We provide a framework for integrating two stages of radiation treatment planning (RTP): beam-angle selection (BAS) and dose optimization (DO). The framework is applied to both classical three-dimensional conformal radiotherapy and advanced intensity-modulated radiation therapy. Automated BAS and improved dose distribution are achieved within the framework. A metaheuristic approach, nested partitions, is applied. Alternative BAS and DO algorithms or commercial RTP software and clinical experience can be embedd… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 19 publications
(13 citation statements)
references
References 42 publications
0
13
0
Order By: Relevance
“…Notice that is binary variable, then we prove by two cases. If , from (26) and (27), we obtain , which is equivalent to (24). Similarly, if , from (26) and (28), we obtain , which is again equivalent to (24).…”
Section: Linearization Of Vmat Rtp Modelmentioning
confidence: 84%
See 2 more Smart Citations
“…Notice that is binary variable, then we prove by two cases. If , from (26) and (27), we obtain , which is equivalent to (24). Similarly, if , from (26) and (28), we obtain , which is again equivalent to (24).…”
Section: Linearization Of Vmat Rtp Modelmentioning
confidence: 84%
“…If , from (26) and (27), we obtain , which is equivalent to (24). Similarly, if , from (26) and (28), we obtain , which is again equivalent to (24). We obtain the linearized model by substituting (2) with (32) and adding (26)-(28).…”
Section: Linearization Of Vmat Rtp Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…Shi and Olafsson (2000) pointed out that the optimal solutions correspond to the set of absorbing states and the Markov chain will eventually reach one of the absorbing states. Finite time behavior of NP was discussed in Shi and Olafsson (2000) and further analyzed for the beam angle selection problem by Zhang et al (2009). In particular, the expected number E[Y] of iterations until the NP Markov chain gets absorbed is given by, E[Y]=1P0dtrue(true(1(1P0M)dtrue)(1P0)(M1)P0(M1+P0)+P0P0d+11P0true) where P 0 is the success probability of NP, which is the probability of the algorithm moving in the correct direction.…”
Section: Methodsmentioning
confidence: 99%
“…NP framework is a new and powerful optimization method that combines intelligent global sampling with local heuristic search [11].NP-based approaches have been applied in IMRT treatment planning [12] and lot sizing problems [13]. The general idea of NP is to partition the solution research into subregions that can be analyzed and evaluated independently (even in parallel), and compares among all subregions to determine how to guide the partitioning process.…”
Section: Nested-partitions Framework For Solving Linearized Vmatmentioning
confidence: 99%