Darek Michalski

The use of mixed-integer programming for inverse treatment planning with pre-defined field segments

Complex intensity patterns generated by traditional beamlet-based inverse treatment plans are often very difficult to deliver. In the approach presented in this work the intensity maps are controlled by pre-defining field segments to be used for dose optimization. A set of simple rules was used to define a pool of allowable delivery segments and the mixed-integer programming (MIP) method was used to optimize segment weights. The optimization problem was formulated by combining real variables describing segment weights with a set of binary variables, used to enumerate voxels in targets and critical structures. The MIP method was compared to the previously used Cimmino projection algorithm. The field segmentation approach was compared to an inverse planning system with a traditional beamlet-based beam intensity optimization. In four complex cases of oropharyngeal cancer the segmental inverse planning produced treatment plans, which competed with traditional beamlet-based IMRT plans. The mixed-integer programming provided mechanism for imposition of dose–volume constraints and allowed for identification of the optimal solution for feasible problems. Additional advantages of the segmental technique presented here are: simplified dosimetry, quality assurance and treatment delivery.

The Least-Intensity Feasible Solution for Aperture-Based Inverse Planning in Radiation Therapy

Aperture-based inverse planning (ABIP) for intensity modulated radiation therapy (IMRT) treatment planning starts with external radiation fields (beams) that fully conform to the target(s) and then superimposes sub-fields called segments to achieve complex shaping of 3D dose distributions. The segments intensities are determined by solving a feasibility problem. The least-intensity feasible (LIF) solution, proposed and studied here, seeks a feasible solution closest to the origin, thus being of least intensity or least energy. We present a new iterative, primal–dual, algorithm for finding the LIF solution and explain our experimental observation that Cimminos algorithm for feasibility actually converges to a close approximation of the LIF solution. Comparison with linear programming shows that Cimminos algorithm has the additional advantage of generating much smoother solutions.

The dose-volume constraint satisfaction problem for inverse treatment planning with field segments

The prescribed goals of radiation treatment planning are often expressed in terms of dose-volume constraints. We present a novel formulation of a dose-volume constraint satisfaction search for the discretized radiation therapy model. This approach does not rely on any explicit cost function. Inverse treatment planning uses the aperture-based approach with predefined, according to geometric rules, segmental fields. The solver utilizes the simultaneous version of the cyclic subgradient projection algorithm. This is a deterministic iterative method designed for solving the convex feasibility problems. A prescription is expressed with the set of inequalities imposed on the dose at the voxel resolution. Additional constraint functions control the compliance with selected points of the expected cumulative dose-volume histograms. The performance of this method is tested on prostate and head-and-neck cases. The relationships with other models and algorithms of similar conceptual origin are discussed. The demonstrated advantages of the method are: the equivalence of the algorithmic and prescription parameters, the intuitive setup of free parameters, and the improved speed of the method as compared to similar iterative as well as other techniques. The technique reported here will deliver approximate solutions for inconsistent prescriptions.

A deterministic iterative least-squares algorithm for beam weight optimization in conformal radiotherapy

Currently, inverse treatment planning in conformal radiotherapy is, in part, a trial-and-error process due to the interplay of many competing criteria for obtaining a clinically acceptable dose distribution. A new method is developed for beam weight optimization that incorporates clinically relevant nonlinear and linear constraints. The process is driven by a nonlinear, quasi-quadratic objective function and the solution space is defined by a set of linear constraints. At each step of iteration, the optimization problem is linearized by a self-consistent approximation that is local to the existing dose distribution. The dose distribution is then improved by solving a series of constrained least-squares problems using an established method until all prescribed constraints are satisfied. This differs from the current approaches in that it does not rely on the search for the global minimum of a specific objective function. Essentially, our proposed objective function can be construed as a functional that comprises a class of dose-based quadratic objective functions. Empirical adjustment for appropriate model parameters in the construction of objective function is minimized, since these parameters are in effect adaptively adjusted during optimization. The method is robust in solving difficult clinical cases using either aperture or pencil beam based planning techniques for intensity-modulated radiation therapy.

Inherent smoothness of intensity patterns for intensity modulated radiation therapy generated by simultaneous projection algorithms

The efficient delivery of intensity modulated radiation therapy (IMRT) depends on finding optimized beam intensity patterns that produce dose distributions, which meet given constraints for the tumour as well as any critical organs to be spared. Many optimization algorithms that are used for beamlet-based inverse planning are susceptible to large variations of neighbouring intensities. Accurately delivering an intensity pattern with a large number of extrema can prove impossible given the mechanical limitations of standard multileaf collimator (MLC) delivery systems. In this study, we apply Cimminos simultaneous projection algorithm to the beamlet-based inverse planning problem, modelled mathematically as a system of linear inequalities. We show that using this method allows us to arrive at a smoother intensity pattern. Including nonlinear terms in the simultaneous projection algorithm to deal with dose-volume histogram (DVH) constraints does not compromise this property from our experimental observation. The smoothness properties are compared with those from other optimization algorithms which include simulated annealing and the gradient descent method. The simultaneous property of these algorithms is ideally suited to parallel computing technologies.

Inverse treatment planning using volume-based objective functions

The results of optimization of inverse treatment plans depend on a choice of the objective function. Even when the optimal solution for a given cost function can be obtained, a better solution may exist for a given clinical scenario and it could be obtained with a revised objective function. In the approach presented in this work mixed integer programming was used to introduce a new volume-based objective function, which allowed for minimization of the number of under- or overdosed voxels in selected structures. By selecting and prioritizing components of this function the user could drive the computations towards the desired solution. This optimization approach was tested using cases of patients treated for prostate and oropharyngeal cancer. Initial solutions were obtained based on minimization/maximization of the dose to critical structures and targets. Subsequently, the volume-based objective functions were used to locate solutions, which satisfied better clinical objectives particular to each of the cases. For prostate cases, these additional solutions offered further improvements in sparing of the rectum or the bladder. For oropharyngeal cases, families of solutions were obtained satisfying an intensity modulated radiation therapy protocol for this disease site, while offering significant improvement in the sparing of selected critical structures, e.g., parotid glands. An additional advantage of the present approach was in providing a convenient mechanism to test the feasibility of the dose-volume histogram constraints.

Comparison of three IMRT inverse planning techniques that allow partial esophagus sparing in patients receiving thoracic radiation therapy for lung cancer

The purpose of this study is to compare 3 intensity-modulated radiation therapy (IMRT) inverse treatment planning techniques as applied to locally-advanced lung cancer. This study evaluates whether sufficient radiotherapy (RT) dose is given for durable control of tumors while sparing a portion of the esophagus, and whether large number of segments and monitor units are required. We selected 5 cases of locally-advanced lung cancer with large central tumor, abutting the esophagus. To ensure that no more than half of the esophagus circumference at any level received the specified dose limit, it was divided into disk-like sections and dose limits were imposed on each. Two sets of dose objectives were specified for tumor and other critical structures for standard dose RT and for dose escalation RT. Plans were generated using an aperture-based inverse planning (ABIP) technique with the Cimmino algorithm for optimization. Beamlet-based inverse treatment planning was carried out with a commercial simulated annealing package (CORVUS) and with an in-house system that used the Cimmino projection algorithm (CIMM). For 3 of the 5 cases, results met all of the constraints from the 3 techniques for the 2 sets of dose objectives. The CORVUS system without delivery efficiency consideration required the most segments and monitor units. The CIMM system reduced the number while the ABIP techniques showed a further reduction, although for one of the cases, a solution was not readily obtained using the ABIP technique for dose escalation objectives.