Optimisation of Irradiation Directions in IMRT Planning Rick Johnston Matthias Ehrgott Department of Engineering Science University of Auckland M. Ehrgott,

Slides:



Advertisements
Similar presentations
Integer Optimization Basic Concepts Integer Linear Program(ILP): A linear program except that some or all of the decision variables must have integer.
Advertisements

1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.
Solving IPs – Cutting Plane Algorithm General Idea: Begin by solving the LP relaxation of the IP problem. If the LP relaxation results in an integer solution,
© Imperial College London Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming Kish Shen and Joachim Schimpf IC-Parc.
RapidArc plan verification using ArcCHECK™
EE 553 Integer Programming
Lecture 10: Integer Programming & Branch-and-Bound
Progress in Linear Programming Based Branch-and-Bound Algorithms
Optimizing Radiation Treatment Planning for Tumors Using IMRT Laura D. Goadrich Industrial Engineering & Department of Computer Sciences at University.
Radiotherapy Planning Stephen C. Billups University of Colorado at Denver
Introduction to Linear and Integer Programming
Effects of Sampling in IMRT Optimization by Ronald L. Rardin Professor of Industrial Engineering Purdue University West Lafayette, Indiana, USA Caesarea.
Multi-criteria Design of X-bar control chart Zhaojun (Steven) Li IND E 516 Homework 1.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 6 th edition Cliff T. Ragsdale © 2011 Cengage Learning. All Rights.
Computational Methods for Management and Economics Carla Gomes
Integer Programming Difference from linear programming –Variables x i must take on integral values, not real values Lots of interesting problems can be.
1 Mixed Integer Programming Approaches for Index Tracking and Enhanced Indexation Nilgun Canakgoz, John Beasley Department of Mathematical Sciences, Brunel.
1 Contents college 3 en 4 Book: Appendix A.1, A.3, A.4, §3.4, §3.5, §4.1, §4.2, §4.4, §4.6 (not: §3.6 - §3.8, §4.2 - §4.3) Extra literature on resource.
LP formulation of Economic Dispatch
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
1 Lecture 4 Maximal Flow Problems Set Covering Problems.
Laura Goadrich13 Dec 2004 A Metaheuristic for IMRT Intensity Map Segmentation Laura D. Goadrich October 15, 2004 Supported with NSF Grant DMI
Sampling Issues for Optimization in Radiotherapy Michael C. Ferris R. Einarsson Z. Jiang D. Shepard.
MIT and James Orlin © More Linear Programming Models.
A Metaheuristic for IMRT Intensity Map Segmentation Athula Gunawardena, Warren D’Souza, Laura D. Goadrich, Kelly Sorenson, Robert Meyer, and Leyuan Shi.
Mathematical Programming for Optimisation Mike Morgan and Vic Grout Centre for Applied Internet Research (CAIR) University of Wales NEWI Plas Coch Campus,
Efficient and Scalable Computation of the Energy and Makespan Pareto Front for Heterogeneous Computing Systems Kyle M. Tarplee 1, Ryan Friese 1, Anthony.
Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.
Approximation Algorithms Department of Mathematics and Computer Science Drexel University.
Strong Bounds for Linear Programs with Cardinality Limited Violation (CLV) Constraint Systems Ronald L. Rardin University of Arkansas
Workforce scheduling – Days off scheduling 1. n is the max weekend demand n = max(n 1,n 7 ) Surplus number of employees in day j is u j = W – n j for.
MILP algorithms: branch-and-bound and branch-and-cut
Logical Topology Design
Medical Accelerator F. Foppiano, M.G. Pia, M. Piergentili
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 11-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 11.
Tobias Achterberg Konrad-Zuse-Zentrum für Informationstechnik Berlin Branching SCIP Workshop at ZIB October 2007.
Chapter 1. Formulations 1. Integer Programming  Mixed Integer Optimization Problem (or (Linear) Mixed Integer Program, MIP) min c’x + d’y Ax +
Energy-Efficient Sensor Network Design Subject to Complete Coverage and Discrimination Constraints Frank Y. S. Lin, P. L. Chiu IM, NTU SECON 2005 Presenter:
1 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
1 Radiotherapy, hadrontherapy and treatment planning systems. Faiza Bourhaleb INFN-Torino University Med 1er-Morocco  Radiotherapy  Optimization techniques.
1 Lagrangean Relaxation --- Bounding through penalty adjustment.
15.053Tuesday, April 9 Branch and Bound Handouts: Lecture Notes.
1 Multi-Objective Portfolio Optimization Jeremy Eckhause AMSC 698S Professor S. Gabriel 6 December 2004.
Integer Linear Programming Terms Pure integer programming mixed integer programming 0-1 integer programming LP relaxation of the IP Upper bound O.F. Lower.
Branch-and-Cut Valid inequality: an inequality satisfied by all feasible solutions Cut: a valid inequality that is not part of the current formulation.
Divide and Conquer Optimization problem: z = max{cx : x  S}
CPS Brief introduction to linear and mixed integer programming
FATCOP: A Mixed Integer Program Solver Michael FerrisQun Chen Department of Computer Sciences University of Wisconsin-Madison Jeff Linderoth, Argonne.
Integer LP In-class Prob
Implicit Hitting Set Problems Richard M. Karp Erick Moreno Centeno DIMACS 20 th Anniversary.
FATCOP: A Mixed Integer Program Solver Michael FerrisQun Chen University of Wisconsin-Madison Jeffrey Linderoth Argonne National Laboratories.
1.2 Guidelines for strong formulations  Running time for LP usually depends on m and n ( number of iterations O(m), O(log n)). Not critically depend on.
Lagrangean Relaxation
A Local Relaxation Approach for the Siting of Electrical Substations Walter Murray and Uday Shanbhag Systems Optimization Laboratory Department of Management.
Minimizing Beam-On Time in Cancer Radiation Treatment Using Multileaf Collimators Natashia Boland Horst W. Hamacher Frank Lenzen January 4, 2002.
EMIS 8373: Integer Programming Column Generation updated 12 April 2005.
Linear Programming Chapter 1 Introduction.
TU/e Algorithms (2IL15) – Lecture 12 1 Linear Programming.
Chapter 6 Optimization Models with Integer Variables.
Flair development for the MC TPS Wioletta Kozłowska CERN / Medical University of Vienna.
CPS Brief introduction to linear and mixed integer programming
Role and Potential of TAs for Industrial Scheduling Problems
Approximation algorithms
Lecture 11: Tree Search © J. Christopher Beck 2008.
EMIS 8373: Integer Programming
An optimization approach to automate radiotherapy treatment planning
Brief introduction to linear and mixed integer programming
Minimum Cost Network Flow Problems
1.2 Guidelines for strong formulations
1.2 Guidelines for strong formulations
Presentation transcript:

Optimisation of Irradiation Directions in IMRT Planning Rick Johnston Matthias Ehrgott Department of Engineering Science University of Auckland M. Ehrgott, R. Johnston Optimisation of Irradiation Directions in IMRT Planning, OR Spectrum 25(2): , 2003

What is Radiotherapy?

 Intensity modulation - improves treatment quality  Inverse planning problem - conflicting objectives to irradiate tumour without damage to healthy organs IMRT

Model Formulation  Discretisation of Body and Beam gantry Voxels Bixels

Angle Discretisation  Linearises the problem  A number of LPs to be solved  Replicates physical setup

MOMIP Model Data  L 1 = lower bound in tumour  U k = upper bound in organ k  R = number of directions to be used Variables and functions  Intensity vector x = (x 11,...,x HN )  Direction choice vector y = (y 1,...,y H )  Deviation vector T = (T 1,...,T K )  Dose distribution vectors D k = (D k1,...,D kMk )

min (T 1,...,T K ) min (T 1,...,T K ) D 1 = P 1 x  (L 1 - T 1 )1 D 1 = P 1 x  (L 1 - T 1 )1 D k = P k x  (U k + T k )1, k=2,...,K D k = P k x  (U k + T k )1, k=2,...,K x hi  My h, h=1,…,H, i=1,…,N x hi  My h, h=1,…,H, i=1,…,N y y H  R y h  {0,1} h=1,...,H y h  {0,1} h=1,...,H T, x  0 T, x  0 To study effect of direction optimisation consider weighted sum min  1 T 1 +  2 T  K T K Extension of multicriteria model by Hamacher/Küfer

Solution Methods Two-phase Methods 3. Set Covering 4. LP Relaxation Integrated Methods 1. Mixed Integer Formulation 2. Local Search Heuristics

Integrated Methods  CPLEX 7.0  If R increases problem becomes easier, objective value improves  For small R and small angle discretisation often no feasible solution found MIP SOLVER 1

 Optimal solution of MIP problem Isodose curve pictures obtained with prototype software developed at ITWM, Kaiserslautern

Integrated Methods  Alter each gantry position in turn to find better angles  Steepest descent with randomised starting angles  Solve LP for each selection of angles LOCAL SEARCH 2

Local Search Movie

Two-phase Methods  Intuitive  Considers all angles  Relatively quick Fully irradiate every voxel in the tumour Avoid damage to healthy organs Benefits: SET COVERING 3

min C 1 y C S y S Ay  1 Ay  1 y {0,1} y {0,1} a ij =1 if and only if beam j hits voxel i  Weighted angle method C j is sum of  k /U k over all organs at risk and voxels in beam j  Dose deposition method C j is sum of  k P k (i,j)/U k over all voxels and all organs at risk

 Cost coefficients

 Set Covering Solution  MIP Solution

4 Two-Phase Methods LP RELAXATION Optimal solution of LP relaxation beams used

Results  All methods were successful in generating good treatment plans in a reasonable timeframe (10 min)  Optimal beams were often counterintuitive  Angle optimisation is important if few beams to be used

 Solution with equidistant beams  Solution with optimised beams

Comparison Objective Problem 1 3 headsProblem 1 4 headsProblem 2 3 headsProblem 2 4 headsProblem 3 3 heads Set Covering LP relaxation Local Search Mixed Integer

Objective vs. Time Objective Time (s) Local search improvement Set Covering Local Search LP relaxation Mixed Integer