- Title
- A new sequential extraction heuristic for optimizing the delivery of cancer radiation treatment using multileaf collimators
- Creator
- Baatar, Davaatseren; Boland, Natashia; Johnston, Robert; Hamacher, Horst W.
- Relation
- INFORMS Journal on Computing Vol. 21, Issue 2, p. 224-241
- Publisher Link
- http://dx.doi.org/10.1287/ijoc.1080.0288
- Publisher
- Institute for Operations Research and the Management Sciences (INFORMS)
- Resource Type
- journal article
- Date
- 2009
- Description
- Finding a delivery plan for cancer radiation treatment using multileaf collimators operating in “step-and-shoot” mode can be formulated mathematically as a problem of decomposing an integer matrix into a weighted sum of binary matrices having the consecutive-ones property and sometimes other properties related to the collimator technology. The efficiency of the delivery plan is measured by both the sum of the weights in the decomposition, known as the total beam-on time, and the number of different binary matrices appearing in it, referred to as the cardinality, the latter being closely related to the setup time of the treatment. In practice, the total beam-on time is usually restricted to its minimum possible value (which is easy to find), and a decomposition that minimizes cardinality (subject to this restriction) is sought. This decomposition problem is known to be NP-hard, and the best available exact solution methods cannot solve, in reasonable time, problems with dimensions large enough to be of use in actual medical applications. In this paper, we propose a new heuristic. To ensure that the heuristic is computationally efficient, we make use of exact bounds that apply to the decomposition and prove that these bounds can be computed efficiently. We demonstrate that the heuristic performs very well numerically against the best previously published heuristic (that of Kalinowski), reducing the average gap between the cardinality of the solution found and the optimal value by 37% on the largest problems tested (for which optimal solutions could be found). Importantly, this new heuristic performs well on those instances that are problematical for Kalinowski's heuristic. A “best-of” algorithm, combining heuristics, produces a decomposition with cardinality within one of optimal in about 98.7% of instances tested (for which an optimal solution is available). It reduces the cardinality of solutions produced by about 5% on average. On instances for which optimal solutions can be found, it more than halves the optimality gap and finds an optimal solution in about 28% more cases than Kalinowski's heuristic.
- Subject
- matrix decomposition; multileaf collimator sequencing; cancer radiation therapy
- Identifier
- http://hdl.handle.net/1959.13/939501
- Identifier
- uon:12827
- Identifier
- ISSN:1091-9856
- Language
- eng
- Reviewed
- Hits: 2163
- Visitors: 2427
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|