Minimizing beam‐on time in cancer radiation treatment using multileaf collimators

Abstract

In this article the modulation of intensity matrices arising in cancer radiation therapy using multileaf collimators (MLC) is investigated. It is shown that the problem is equivalent to decomposing a given integer matrix into a positive linear combination of (0, 1) matrices. These matrices, called shape matrices, must have the strict consecutive‐1‐property, together with another property derived from the technological restrictions of the MLC equipment. Various decompositions can be evaluated by their beam‐on time (time during which radiation is applied to the patient) or the treatment time (beam‐on time plus time for setups). We focus on the former, and develop a nonlinear mixed‐integer programming formulation of the problem. This formulation can be decomposed to yield a column generation formulation: a linear program with a large number of variables that can be priced by solving a subproblem. We then develop a network model in which paths in the network correspond to feasible shape matrices. As a consequence, we deduce that the column generation subproblem can be solved as a shortest path problem. Furthermore, we are able to develop two alternative models of the problem as side‐constrained network flow formulations, and so obtain our main theoretical result that the problem is solvable in polynomial time. Finally, a numerical comparison of our exact solutions with those of well‐known heuristic methods shows that the beam‐on time can be reduced by a considerable margin. © 2004 Wiley Periodicals, Inc.

Approximation algorithms for minimizing segments in radiation therapy

“…Successful implementation of IMRT technology hinges on the delivery of a two-dimensional integral radiation intensity matrix T using a device called the multileaf collimator (MLC) [3,8].…”

Decomposition of matrices and static multileaf collimators: a survey

“…Theorem 2.3 (Boland et al (2004)) The decomposition time problem with respect to a given non-negative integer valued matrix A is equivalent to the decomposition network flow problem: Minimize the flow value from source D to sink D subject to the constraints that for all m ∈ M and n ∈ N the sum of the flow through nodes (m, l, r) with l ≤ n < r equals the entry a m,n . In particular, the DT problem is solvable in polynomial time.…”

Radiotherapy optimAl Design: An Academic Radiotherapy Treatment Design System

“…Although the leaves move continuously, we horizontally divide the open-field to approximate the continuous motion and design a treatment that has a unique value for each rectangular sub-beam. The exposure pattern formed by the sub-beams is called the fluence pattern, and an active area of research is to decide how to best adjust the collimator to achieve the fluence pattern as efficiently as possible [1,4,9].…”