An Integer Programming Approach to the Multileaf Collimator Problem
- This essay discusses the multileaf collimator leaf sequencing problem, which occurs in every treatment planning in radiation therapy. The problem is to find a good realization in terms of a leaf sequence in the multileaf collimator such that the time needed to deliver the given dose profile is minimized. A mathematical model using an integer programming formulation has been developed. Additionally, a heuristic, based on existing algorithms and an integer programming formulation, has been developed to enhance the quality of the solutions. Comparing the results to those provided by other algorithms, a significant improvement can be observed.
Download full text files
Additional Services
| Author: | Frank Lenzen |
|---|---|
| URN: | urn:nbn:de:hbz:386-kluedo-10069 |
| Document Type: | Diploma Thesis |
| Language of publication: | English |
| Year of Completion: | 2000 |
| Year of first Publication: | 2000 |
| Publishing Institution: | Technische Universität Kaiserslautern |
| Granting Institution: | Technische Universität Kaiserslautern |
| Date of the Publication (Server): | 2000/06/29 |
| Tag: | MLC; Medical Physics; Multileaf Collimator; Optimization; Radiation Therapy |
| Faculties / Organisational entities: | Kaiserslautern - Fachbereich Mathematik |
| DDC-Cassification: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
| MSC-Classification (mathematics): | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C06 Large-scale problems |
| Licence (German): |  Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |