TY - JOUR
T1 - A new column-generation-based algorithm for VMAT treatment plan optimization
AU - Peng, Fei
AU - Jia, Xun
AU - Gu, Xuejun
AU - Epelman, Marina A.
AU - Romeijn, H. Edwin
AU - Jiang, Steve B.
PY - 2012/7/21
Y1 - 2012/7/21
N2 - We study the treatment plan optimization problem for volumetric modulated arc therapy (VMAT). We propose a new column-generation-based algorithm that takes into account bounds on the gantry speed and dose rate, as well as an upper bound on the rate of change of the gantry speed, in addition to MLC constraints. The algorithm iteratively adds one aperture at each control point along the treatment arc. In each iteration, a restricted problem optimizing intensities at previously selected apertures is solved, and its solution is used to formulate a pricing problem, which selects an aperture at another control point that is compatible with previously selected apertures and leads to the largest rate of improvement in the objective function value of the restricted problem. Once a complete set of apertures is obtained, their intensities are optimized and the gantry speeds and dose rates are adjusted to minimize treatment time while satisfying all machine restrictions. Comparisons of treatment plans obtained by our algorithm to idealized IMRT plans of 177 beams on five clinical prostate cancer cases demonstrate high quality with respect to clinical dose-volume criteria. For all cases, our algorithm yields treatment plans that can be delivered in around 2min. Implementation on a graphic processing unit enables us to finish the optimization of a VMAT plan in 25-55s.
AB - We study the treatment plan optimization problem for volumetric modulated arc therapy (VMAT). We propose a new column-generation-based algorithm that takes into account bounds on the gantry speed and dose rate, as well as an upper bound on the rate of change of the gantry speed, in addition to MLC constraints. The algorithm iteratively adds one aperture at each control point along the treatment arc. In each iteration, a restricted problem optimizing intensities at previously selected apertures is solved, and its solution is used to formulate a pricing problem, which selects an aperture at another control point that is compatible with previously selected apertures and leads to the largest rate of improvement in the objective function value of the restricted problem. Once a complete set of apertures is obtained, their intensities are optimized and the gantry speeds and dose rates are adjusted to minimize treatment time while satisfying all machine restrictions. Comparisons of treatment plans obtained by our algorithm to idealized IMRT plans of 177 beams on five clinical prostate cancer cases demonstrate high quality with respect to clinical dose-volume criteria. For all cases, our algorithm yields treatment plans that can be delivered in around 2min. Implementation on a graphic processing unit enables us to finish the optimization of a VMAT plan in 25-55s.
UR - http://www.scopus.com/inward/record.url?scp=84863517865&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863517865&partnerID=8YFLogxK
U2 - 10.1088/0031-9155/57/14/4569
DO - 10.1088/0031-9155/57/14/4569
M3 - Article
C2 - 22722760
AN - SCOPUS:84863517865
SN - 0031-9155
VL - 57
SP - 4569
EP - 4588
JO - Physics in Medicine and Biology
JF - Physics in Medicine and Biology
IS - 14
ER -