Abstract
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 beam-on 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.
Similar content being viewed by others
References
Ahuja, R. K., & Hamacher, H. W. (2004). Linear time network flow algorithm to minimize beam-on-time for unconstrained multileaf collimator problems in cancer radiation therapy. Networks, 45(1), 36–41.
Baatar, D. (2005). Matrix decomposition with time and cardinality objectives: Theory, algorithms and application to multileaf collimator sequencing. PhD thesis, University of Kaiserslautern, Germany.
Baatar, D., Boland, N., Brand, S., & Stuckey, P. J. (2007). Minimum cardinality matrix decomposition into consecutive-ones matrices: CP and IP approaches. In P. Van Hentenryck & L. A. Wolsey (Eds.), 4th int. conf. on integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR’07). LNCS (Vol. 4510, pp. 1–15). Springer.
Baatar, D., Hamacher, H. W., Ehrgott, M., & Woeginger, G. J. (2005). Decomposition of integer matrices and multileaf collimator sequencing. Discrete Applied Mathematics, 152(1–3), 6–34.
Bansal, N., Coppersmith, D., & Schieber, B. (2006). Minimizing setup and beam-on times in radiation therapy. In J. Díaz, K. Jansen, J. D. P. Rolim, & U. Zwick (Eds.), 9th int. workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’06). LNCS (Vol. 4110, pp. 27–38). Springer.
Brand, S. (2009). The sum-of-increments constraint in the consecutive-ones matrix decomposition problem. In S. Y. Shin & S. Ossowski (Eds.), Symposium on Applied Computing (SAC’09) (pp. 1417–1418). ACM.
Cambazard, H., O’Mahony, E., & O’Sullivan, B. (2009). A shortest path-based approach to the multileaf collimator sequencing problem. In W. J. van Hoeve & J. N. Hooker (Eds.), CPAIOR. LNCS (Vol. 5547, pp. 41–55). Springer.
Chen, D. Z., Hu, X. S., Wang, C., & Wu, X. R. (2005). Mountain reduction, block matching, and applications in intensity-modulated radiation therapy. In J. S. B. Mitchell & G. Rote (Eds.), Symposium on Computational Geometry (SGC’05) (pp. 35–44). ACM.
Choi, C. W., Harvey, W., Lee, J. H. M., & Stuckey, P. J. (2006). Finite domain bounds consistency revisited. In Australian conference on artificial intelligence. LNCS (Vol. 4304, pp. 49–58). Springer.
Dirkx, M. (2000). Static and dynamic intensity modulation in radiotherapy using a multileaf collimator. PhD thesis, Daniel de Hoed Cancer Centre, University Hospital Rotterdam, The Netherlands.
Ehrgott, M., Güler, Ç., Hamacher, H. W., & Shao, L. (2008). Mathematical optimization in intensity modulated radiation therapy. 4OR, 6(3), 199–262.
Ehrgott, M., Hamacher, H. W., & Nußbaum, M. (2008). Decomposition of matrices and static multileaf collimators: a survey. In C. J. S. Alves, P. M. Pardalos, & L. N. Vicente (Eds.), Optimization in medicine (pp. 25–46). Springer.
Engel, K. (2005). A new algorithm for optimal multileaf collimator leaf segmentation. Discrete Applied Mathematics, 152(1–3), 35–51.
Ernst, A. T., Mak, V. H., & Mason, L. R. (2009). An exact method for the minimum cardinality problem in the treatment planning of intensity-modulated radiotherapy. INFORMS Journal on Computing, 21(4), 562–574.
G12 Team (2010). The G12 constraint programming platform. www.nicta.com.au/research/projects/constraint_programming_platform.
Hamacher, H. W., & Küfer, K.-H. (2002). Inverse radiation therapy planning: A multiple objective optimisation approach. Discrete Applied Mathematics, 118, 145–161.
Kalinowski, T. (2005). Optimal multileaf collimator field segmentation. PhD thesis, University of Rostock, Germany.
Kalinowski, T. (2008). Multileaf collimator shape matrix decomposition. In G. J. Lim (Ed.), Optimization in medicine and biology (pp. 249–282). Auerbach.
Langer, M., Thai, V., & Papiez, L. (2001). Improved leaf sequencing reduces segments or monitor units needed to deliver IMRT using multileaf collimators. Medical Physics, 28, 2450–2458.
Maher, M. J. (2002). Analysis of a global contiguity constraint. In 4th workshop on Rule-based Constraint Reasoning and Programming (RCoRP’02).
Mak, V. (2007). Iterative variable aggregation and disaggregation in IP: An application. Operations Research Letters, 35(1), 36–44.
Pardalos, P. M., & Romeijn, H. E. (Eds.) (2008). Handbook of optimization in medicine. Springer.
Romeijn, H. E., Ahuja, R. K., Dempsey, J. F., Kumar, A., & Li, J. G. (2003). A novel linear programming approach to fluence map optimization for intensity modulated radiation therapy planning. Physics in Medicine & Biology, 48, 3521–3542.
Shen, K., & Schimpf, J. (2005). Eplex: Harnessing mathematical programming solvers for constraint logic programming. In P. van Beek (Ed.), 11th int. conference on principles and practice of Constraint Programming (CP’05). LNCS (Vol. 3709, pp. 622–636). Springer.
Tepper, J. E., & Mackie, T. R. (1999). Radiation therapy treatment optimization. In Seminars in radiation oncology (Vol. 9, pp. 1–118). Elsevier.
Wallace, M. G., Novello, S., & Schimpf, J. (1997). ECLiPSe: A platform for constraint logic programming. ICL Systems Journal, 12(1), 159–200.
Webb, S. (2001). Intensity-modulated radiation therapy. Institute of Physics Publishing.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Baatar, D., Boland, N., Brand, S. et al. CP and IP approaches to cancer radiotherapy delivery optimization. Constraints 16, 173–194 (2011). https://doi.org/10.1007/s10601-010-9104-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10601-010-9104-1