A column generation approach to radiation therapy treatment planning using aperture modulation

被引:123
作者
Romeijn, HE
Ahuja, RK
Dempsey, JF
Kumar, A
机构
[1] Univ Florida, Dept Ind & Syst Engn, Gainesville, FL 32611 USA
[2] Univ Florida, Dept Radiat Oncol, Gainesville, FL 32610 USA
关键词
radiation therapy; aperture modulation; convex optimization; column generation; pricing problem;
D O I
10.1137/040606612
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper considers the problem of radiation therapy treatment planning for cancer patients. During radiation therapy, beams of radiation pass through a patient. This radiation kills both cancerous and normal cells, so the radiation therapy must be carefully planned to deliver a clinically prescribed dose to certain targets while sparing nearby organs and tissues. Currently, a technique called intensity modulated radiation therapy (IMRT) is considered to be the most effective radiation therapy for many forms of cancer. In IMRT, the patient is irradiated from several different directions. From each direction, one or more irregularly shaped radiation beams of uniform intensity are used to deliver the treatment. This paper deals with the problem of designing a treatment plan for IMRT that determines an optimal set of such shapes ( called apertures) and their corresponding intensities. This is in contrast with established two-stage approaches where, in the first phase, each radiation beam is viewed as consisting of a set of individual beamlets, each with its own intensity. A second phase is then needed to approximate and decompose the optimal intensity pro. le into a set of apertures with corresponding intensities. The problem is formulated as a large-scale convex programming problem, and a column generation approach to deal with its dimensionality is developed. The associated pricing problem determines, in each iteration, one or more apertures to be added to our problem. Several variants of this pricing problem are discussed, each corresponding to a particular set of constraints that the apertures must satisfy in one or more of the currently available types of commercial IMRT equipment. Polynomial- time algorithms are presented for solving each of these variants of the pricing problem to optimality. Finally, the effectiveness of our approach is demonstrated on clinical data.
引用
收藏
页码:838 / 862
页数:25
相关论文
共 50 条
[1]  
AHUJA R, 2003, LINEAR TIME NETWORK
[2]  
Ahuja RK, 1993, NETWORK FLOWS THEORY
[3]   K-ECCENTRICITY AND ABSOLUTE K-CENTRUM OF A PROBABILISTIC TREE [J].
ANDREATTA, G ;
MASON, F .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 19 (01) :114-117
[4]  
[Anonymous], 1996, CONVEX ANAL MINIMIZA
[5]  
[Anonymous], 1995, American Cancer Society Textbook of Clincal Oncology
[6]  
[Anonymous], 2004, Cancer Facts and Figures
[7]   PROOFS AS PROGRAMS [J].
BATES, JL ;
CONSTABLE, RL .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1985, 7 (01) :113-136
[8]  
Bazaraa M. S., 2013, NONLINEAR PROGRAMMIN
[9]   The use of mixed-integer programming for inverse treatment planning with pre-defined field segments [J].
Bednarz, G ;
Michalski, D ;
Houser, C ;
Huq, MS ;
Xiao, Y ;
Anne, PR ;
Galvin, JM .
PHYSICS IN MEDICINE AND BIOLOGY, 2002, 47 (13) :2235-2245
[10]  
Bentley J., 1986, PROGRAMMING PEARLS, VSecond