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.
Verfasser*innenangaben: | Frank Lenzen |
---|---|
URN: | urn:nbn:de:hbz:386-kluedo-10069 |
Dokumentart: | Diplomarbeit |
Sprache der Veröffentlichung: | Englisch |
Jahr der Fertigstellung: | 2000 |
Jahr der Erstveröffentlichung: | 2000 |
Veröffentlichende Institution: | Technische Universität Kaiserslautern |
Titel verleihende Institution: | Technische Universität Kaiserslautern |
Datum der Publikation (Server): | 29.06.2000 |
Freies Schlagwort / Tag: | MLC; Medical Physics; Multileaf Collimator; Optimization; Radiation Therapy |
Fachbereiche / Organisatorische Einheiten: | Kaiserslautern - Fachbereich Mathematik |
DDC-Sachgruppen: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
MSC-Klassifikation (Mathematik): | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C06 Large-scale problems |
Lizenz (Deutsch): | Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |