Article ID: | iaor20125264 |
Volume: | 63 |
Issue: | 10 |
Start Page Number: | 1447 |
End Page Number: | 1456 |
Publication Date: | Oct 2012 |
Journal: | Journal of the Operational Research Society |
Authors: | Ernst A T, Mason L R, Mak-Hau V H |
Keywords: | combinatorial optimization, heuristics, medicine |
In this paper, we solve a combinatorial optimization problem that arises from the treatment planning of a type of radiotherapy where intensity is modulated by multileaf collimators (MLC) in a step‐and‐shoot manner. In Ernst et al (2009), we proposed an exact method for minimizing the number of MLC apertures needed for a treatment. Our method outperformed the fastest algorithms available at the time. We refer to our method as the CPI method. We now attempt to minimize the total treatment time by modifying our CPI method. This modification involves non‐trivial work, as some of the search space elimination schemes used in the CPI method cannot be applied in here. In our numerical experiments, we again compare our new method with the fastest algorithms currently available. There has been significant recent research in this area; hence we compare our method with those published in Wake et al (2009): 795–810], Taşkin et al [(2010), and Cambazard et al (2010). The numerical comparisons indicate that our method generally outperformed the first two, while being competitive with the third.