Search PubMed⌕ Search

Biomedical subjects

S Morrill

Publications and source records attributed to S Morrill.

3 recordsLinked to original sources

A comparison of mixed integer programming and fast simulated annealing for optimizing beam weights in radiation therapy.

Two competing methods for assigning intensities to radiation treatment beams were tested. One method was derived from mixed integer programming and the other was based on simulated annealing. The methods faced a common objective and identical constraints. The goal was to maximize the minimum tumor dose while keeping the dose in required fractions of normal organ volumes below a threshold for damage. The minimum tumor doses of the two methods were compared when all the dose-volume constraints were satisfied. A mixed integer linear program gave a minimum tumor dose that was at least 1.8 Gy higher than that given by simulated annealing in 7 of 19 trials. The difference was > or = 5.4 Gy in 4 of 19 trials. In no case was the mixed integer solution one fraction size (1.8 Gy) worse than that of simulated annealing. The better solution provided by the mixed integer program allows tumor dose to increase without violating the dose-volume limits of normal tissues.

Abdominal Neoplasms↗

A generic genetic algorithm for generating beam weights.

A genetic algorithm for generating beam weights is described. The algorithm improves an objective measure of the dose distribution while respecting dose volume constraints placed on critical structures. The algorithm was used to select beam weights for treatment of abdominal tumors. Weights were selected for up to 36 beams. Dose volume limits were placed on normal organs and a dose inhomogeneity limit was placed on tumor. Volumes were represented as sets of several hundred discrete points. The algorithm searched for the beam weights that would make the minimum tumor dose as high as the constraints would allow. The results were checked using dose volume histograms with standard sized grids. Nineteen trials were created using six patient cases by changing the required field margin or allowed beam position in each case. The sampling of points was sufficiently dense to yield solutions that strictly satisfied the constraints when the prescribed dose was renormalized by a factor of less than 6%. The genetic algorithm supplied solutions in 49 min on average, and in a maximum time of 87 min. The randomized search does not guarantee optimality, but high tumor doses were obtained. An example is shown for which the solution of the genetic algorithm gave a minimum tumor dose 7 Gy higher than the solution given by a simulated annealing algorithm under the same set of constraints. The genetic algorithm can be generalized to admit nonlinear functions of the beam intensities in the objective or in the constraints. These can include tumor control and normal tissue complication probabilities. The genetic algorithm is an attractive procedure for assigning beam weights in multifield plans. It improves the dose distribution while respecting specified rules for tissue tolerance.

Abdominal Neoplasms↗