- Title
- CP and IP approaches to cancer radiotherapy delivery optimization
- Creator
- Baatar, Davaatseren; Boland, Natashia; Brand, Sebastian; Stuckey, Peter J.
- Relation
- Constraints Vol. 16, Issue 2, p. 173-194
- Publisher Link
- http://dx.doi.org/10.1007/s10601-010-9104-1
- Publisher
- Springer
- Resource Type
- journal article
- Date
- 2011
- Description
- We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-known and of practical relevance. It has an important application in cancer radiation therapy treatment planning: the sequencing of multileaf collimators to deliver a given radiation intensity matrix, representing (a component of) the treatment plan. Two criteria characterise the efficacy of a decomposition: the beamon time (the length of time the radiation source is switched on during the treatment), and the cardinality (the number of machine set-ups required to deliver the planned treatment). Minimising the former is known to be easy. However finding a decomposition of minimal cardinality is NP-hard. Progress so far has largely been restricted to heuristic algorithms, mostly using linear programming, integer programming and combinatorial enumerative methods as the solving approaches. We present a novel model, with corresponding constraint programming and integer programming formulations. We compare these computationally with previous formulations, and we show that constraint programming performs very well by comparison.
- Subject
- modelling; symmetry-breaking; search; integer programming ·; intensity-modulated radiation therapy; multileaf collimator leaf sequencing
- Identifier
- http://hdl.handle.net/1959.13/936091
- Identifier
- uon:12212
- Identifier
- ISSN:1383-7133
- Language
- eng
- Reviewed
- Hits: 1348
- Visitors: 1940
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|