title: Fast approximate delivery of fluence maps for IMRT and VMAT.
abstract: In this article we provide a method to generate the trade-off between delivery time and fluence map matching quality for dynamically delivered fluence maps. At the heart of our method lies a mathematical programming model that, for a given duration of delivery, optimizes leaf trajectories and dose rates such that the desired fluence map is reproduced as well as possible. We begin with the single fluence map case and then generalize the model and the solution technique to the delivery of sequential fluence maps. The resulting large-scale, non-convex optimization problem was solved using a heuristic approach. We test our method using a prostate case and a head and neck case, and present the resulting trade-off curves. Analysis of the leaf trajectories reveals that short time plans have larger leaf openings in general than longer delivery time plans. Our method allows one to explore the continuum of possibilities between coarse, large segment plans characteristic of direct aperture approaches and narrow field plans produced by sliding window approaches. Exposing this trade-off will allow for an informed choice between plan quality and solution time. Further research is required to speed up the optimization process to make this method clinically implementable.
authors.affiliation: Department of Econometrics and Operations Research/Center for Economic Research (CentER), Tilburg University, PO Box 90153, 5000 LE Tilburg, The Netherlands.
authors.forename: Marleen
authors.initials: M
authors.lastname: Balvert
authors.forename: David
authors.initials: D
authors.lastname: Craft
mesh_terms: D000465:Algorithms; D006258:Head and Neck Neoplasms / Q000532:radiotherapy*; D006801:Humans; D008297:Male; D011471:Prostatic Neoplasms / Q000532:radiotherapy*; D011879:Radiotherapy Dosage; D011880:Radiotherapy Planning, Computer-Assisted / Q000379:methods*; D050397:Radiotherapy, Intensity-Modulated / Q000379:methods*