Treatment planning for prostate brachytherapy using region of interest adjoint functions and a greedy heuristic

• Published in: Physics in medicine & biology Vol. 48; no. 24; pp. 4077 - 4090
• Main Authors: Yoo, Sua, Kowalok, Michael E, Thomadsen, Bruce R, Henderson, Douglass L
• Format: Journal Article
• Language: English
• Published: Bristol IOP Publishing 21.12.2003; Institute of Physics
• Subjects: Algorithms; Biological and medical sciences; Body Burden; Brachytherapy - methods; Humans; Male; Medical sciences; Prostatic Neoplasms - radiotherapy; Radiometry - methods; Radiotherapy Dosage; Radiotherapy Planning, Computer-Assisted - methods; Radiotherapy. Instrumental treatment. Physiotherapy. Reeducation. Rehabilitation, orthophony, crenotherapy. Diet therapy and various other treatments (general aspects); Reproducibility of Results; Sensitivity and Specificity; Technology. Biomaterials. Equipments. Material. Instrumentation; Biomedical engineering
• ISSN: 0031-9155; 1361-6560
• DOI: 10.1088/0031-9155/48/24/006

We have developed an efficient treatment-planning algorithm for prostate implants that is based on region of interest (ROI) adjoint functions and a greedy heuristic. For this work, we define the adjoint function for an ROI as the sensitivity of the average dose in the ROI to a unit-strength brachytherapy source at any seed position. The greedy heuristic uses a ratio of target and critical structure adjoint functions to rank seed positions according to their ability to irradiate the target ROI while sparing critical structure ROIs. This ratio is computed once for each seed position prior to the optimization process. Optimization is performed by a greedy heuristic that selects seed positions according to their ratio values. With this method, clinically acceptable treatment plans are obtained in less than 2 s. For comparison, a branch-and-bound method to solve a mixed integer-programming model took more than 50 min to arrive at a feasible solution. Both methods achieved good treatment plans, but the speedup provided by the greedy heuristic was a factor of approximately 1500. This attribute makes this algorithm suitable for intra-operative real-time treatment planning.