2006
DOI: 10.1088/0031-9155/51/21/016
|View full text |Cite
|
Sign up to set email alerts
|

Efficient schemes for robust IMRT treatment planning

Abstract: We use robust optimization techniques to formulate an IMRT treatment planning problem in which the dose matrices are uncertain, due to both dose calculation errors and interfraction positional uncertainty of tumour and organs. When the uncertainty is taken into account, the original linear programming formulation becomes a second-order cone program. We describe a novel and efficient approach for solving this problem, and present results to compare the performance of our scheme with more conventional formulatio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 43 publications
(32 citation statements)
references
References 27 publications
0
32
0
Order By: Relevance
“…through manual ''robustification'' of the treatment plans. Computerised robust optimisation techniques have recently been developed [60][61][62]. These robust optimisation techniques are becoming essential in advanced intensity-modulated particle therapy [63], and especially in biologically-guided treatment planning with additional uncertainties in the underlying biological models.…”
Section: Implications For Treatment Planning: Robust Optimisation Andmentioning
confidence: 99%
“…through manual ''robustification'' of the treatment plans. Computerised robust optimisation techniques have recently been developed [60][61][62]. These robust optimisation techniques are becoming essential in advanced intensity-modulated particle therapy [63], and especially in biologically-guided treatment planning with additional uncertainties in the underlying biological models.…”
Section: Implications For Treatment Planning: Robust Optimisation Andmentioning
confidence: 99%
“…For P/C, we have tested both with default Cplex settings, which lead to using the quadratic simplex for solving the relaxations during the B&C, as well as with forcing Cplex to use its IP algorithm throughout all the search. For CP, we have tested both with default Cplex settings and with miqcpstrat = 2, which implements a linearizationbased method for the solution of QCQPs (new to Cplex 11) akin to [11,12,17]. In the Table, columns "nds" and "time" report the number of nodes in the B&C tree and the total running time (in seconds) required by each approach, while column "gap" reports, only for those cases where not all the instances could be solved to optimality within the allotted time limit, the attained gap (in percentage) at termination.…”
Section: Markowitz Mean-variance Modelmentioning
confidence: 99%
“…Combining the two, we get a position uncertainty which can be represented by a stochastic influence matrix K(ω). Olafsson and Wright [42] and Chu et al [13], assume that the doses are stochastic, and use probabilistic constraints to control the dose levels in the target and in the organs at risk. Chan et al [12] use a motion probability mass function, and assumes that the probability itself is uncertain.…”
Section: Traffic Network Designmentioning
confidence: 99%