Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators

Authors:
Giulia M. G. H. Wake;Natashia Boland;Les S. Jennings
Affiliations:
School of Mathematics and Statistics, The University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, Australia;Department of Mathematics and Statistics, The University of Melbourne, Parkville, VIC, 3010 Australia;School of Mathematics and Statistics, The University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, Australia
Venue:
Computers and Operations Research
Year:
2009

Citing 6
Cited 6

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

Networks
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy

Networks
Decomposition of integer matrices and multileaf collimator sequencing

Discrete Applied Mathematics
A new algorithm for optimal multileaf collimator field segmentation

Discrete Applied Mathematics
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint

Discrete Applied Mathematics
Nonnegative integral subset representations of integer sets

Information Processing Letters

Multiobjective Decomposition of Positive Integer Matrix: Application to Radiotherapy

EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators

INFORMS Journal on Computing
Faster optimal algorithms for segment minimization with small maximal value

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A shortest path-based approach to the multileaf collimator sequencing problem

Discrete Applied Mathematics
Hybrid methods for the multileaf collimator sequencing problem

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Faster optimal algorithms for segment minimization with small maximal value

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

The effectiveness of radiation therapy for cancer depends on the patient remaining still during treatment. It is thus important to minimize the total treatment time (TTT). When such treatment is delivered using multileaf collimators in ''step-and-shoot'' mode, it consists of a sequence of collimator configurations, or patterns; for each, the patient is exposed to radiation for a specified time, or beam-on time. The TTT can thus be divided into the total beam-on time and the time spent reconfiguring the collimators. The latter can reasonably be approximated by the number of patterns, multiplied by a constant overhead time per pattern. Previous approaches to this problem have all been heuristic; in particular none of them actually use the pattern overhead time to ascertain the best trade-off between beam-on time and number of patterns. In this paper, we develop exact solution approaches, based on mixed integer programming (MIP) formulations, which minimize the TTT. We consider direct solution of MIP formulations, and then exploit the bicriteria structure of the objective to derive an algorithm that ''steps up'' through the number of patterns used, leading to substantial computational savings.