The Challenge of Steering a Radiation Therapy Planning Optimization by Ronald L. Rardin Professor of Industrial Engineering Purdue University West Lafayette,

Slides:



Advertisements
Similar presentations
A Support Vector Method for Optimizing Average Precision
Advertisements

Integer Optimization Basic Concepts Integer Linear Program(ILP): A linear program except that some or all of the decision variables must have integer.
Computational Methods for Management and Economics Carla Gomes Module 6c Initialization in Simplex (Textbook – Hillier and Lieberman)
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC کنترل پيش بين-دکتر توحيدخواه.
INTRODUCTION TO MODELING
Chapter 1 Introduction to Modeling DECISION MODELING WITH MICROSOFT EXCEL Copyright 2001 Prentice Hall.
Introduction to Mathematical Programming OR/MA 504 Chapter 6 Goal programming and Multiple Objective Optimization.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Radiotherapy Planning Stephen C. Billups University of Colorado at Denver
Effects of Sampling in IMRT Optimization by Ronald L. Rardin Professor of Industrial Engineering Purdue University West Lafayette, Indiana, USA Caesarea.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Principles of Robust IMRT Optimization Timothy Chan Massachusetts Institute of Technology Physics of Radiation Oncology – Sharpening the Edge Lecture 10.
OPTIMAL CONTROL SYSTEMS
Dynamic lot sizing and tool management in automated manufacturing systems M. Selim Aktürk, Siraceddin Önen presented by Zümbül Bulut.
1 1 Slide Chapter 14: Goal Programming Goal programming is used to solve linear programs with multiple objectives, with each objective viewed as a "goal".
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
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.
A New Algorithm for Solving Many-objective Optimization Problem Md. Shihabul Islam ( ) and Bashiul Alam Sabab ( ) Department of Computer Science.
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
Name: Mehrab Khazraei(145061) Title: Penalty or Exterior penalty function method professor Name: Sahand Daneshvar.
Linear Programming.
Graphical Solutions Plot all constraints including nonnegativity ones
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.

Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
Data Mining to Aid Beam Angle Selection for IMRT Stuart Price-University of Maryland Bruce Golden- University of Maryland Edward Wasil- American University.
Parameter selection in prostate IMRT Renzhi Lu, Richard J. Radke 1, Andrew Jackson 2 Rensselaer Polytechnic Institute 1,Memorial Sloan-Kettering Cancer.
Introduction to Management Science Chapter 1: Hillier and Hillier.
MIT and James Orlin © More Linear Programming Models.
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
Trust-Aware Optimal Crowdsourcing With Budget Constraint Xiangyang Liu 1, He He 2, and John S. Baras 1 1 Institute for Systems Research and Department.
Efficient and Scalable Computation of the Energy and Makespan Pareto Front for Heterogeneous Computing Systems Kyle M. Tarplee 1, Ryan Friese 1, Anthony.
Deterministic Operations Research Models J. Paul Brooks Jill R. Hardin Department of Statistical Sciences and Operations Research November 28, 2006.
Ken YoussefiMechanical Engineering Dept. 1 Design Optimization Optimization is a component of design process The design of systems can be formulated as.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
Strong Bounds for Linear Programs with Cardinality Limited Violation (CLV) Constraint Systems Ronald L. Rardin University of Arkansas
1 Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Management Science, 3e by Cliff Ragsdale.
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Goal Seek and Solver. Goal seeking helps you n Find a specific value for a target cell by adjusting the value of one other cell whose value is allowed.
Goal Programming Linear program has multiple objectives, often conflicting in nature Target values or goals can be set for each objective identified Not.
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.
Thursday, May 9 Heuristic Search: methods for solving difficult optimization problems Handouts: Lecture Notes See the introduction to the paper.
VI. Regression Analysis A. Simple Linear Regression 1. Scatter Plots Regression analysis is best taught via an example. Pencil lead is a ceramic material.
Risk Analysis & Modelling
Kanpur Genetic Algorithms Laboratory IIT Kanpur 25, July 2006 (11:00 AM) Multi-Objective Dynamic Optimization using Evolutionary Algorithms by Udaya Bhaskara.
Lecture 1 – Operations Research
Adaptive Hopfield Network Gürsel Serpen Dr. Gürsel Serpen Associate Professor Electrical Engineering and Computer Science Department University of Toledo.
A local search algorithm with repair procedure for the Roadef 2010 challenge Lauri Ahlroth, André Schumacher, Henri Tokola
Chapter 1 Problem Solving with Mathematical Models
Written by Changhyun, SON Chapter 5. Introduction to Design Optimization - 1 PART II Design Optimization.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
Minimizing Beam-On Time in Cancer Radiation Treatment Using Multileaf Collimators Natashia Boland Horst W. Hamacher Frank Lenzen January 4, 2002.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
September 28, 2000 Improved Simultaneous Data Reconciliation, Bias Detection and Identification Using Mixed Integer Optimization Methods Presented by:
IE 312 Review 1. The Process 2 Problem Model Conclusions Problem Formulation Analysis.
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
Athula D. A. Gunawardena, Michael C. Ferris and Robert R. Meyer University of Wisconsin-Whitewater, and University of Wisconsin-Madison.
TU/e Algorithms (2IL15) – Lecture 12 1 Linear Programming.
Decision Support Systems
Fig. 4. Percentage of passing rate between clinical and 544 plans.
Dr. Arslan Ornek IMPROVING SEARCH
Chapter 8. General LP Problems
Chapter 5. The Duality Theorem
FOUNDATIONS OF MODERN SCIENTIFIC PROGRAMMING
Dr. Arslan Ornek DETERMINISTIC OPTIMIZATION MODELS
What are optimization methods?
Dr. Arslan Ornek MATHEMATICAL MODELS
Presentation transcript:

The Challenge of Steering a Radiation Therapy Planning Optimization by Ronald L. Rardin Professor of Industrial Engineering Purdue University West Lafayette, Indiana, USA Caesarea Rothschild Institute, University of Haifa, June 2004

Acknowledgments Our work at Purdue involves an inter- disciplinary team (of 10-15) spanning –Indiana University School of Medicine –Purdue University College of Engineering –Advanced Process Combinatorics (an optimization software firm) Dr. Mark Langer = our inspiration and medical mentor Sponsored in part by National Science Foundation , National Cancer Institute 1R41CA , and Indiana 21 st Century Fund

External Beam Radiation Therapy Delivered by an accelerator that can rotate 360 degrees around the patient to treat a target at the isocenter from multiple angles Implemented with a Multi-Leaf Collimator varying opening during delivery time

Choices for Beamlet Intensities Accelerator Intensity Map (Profile)

Planning Dose Conflict Accelerator Planning seeks beamlet intensities –Sufficient dose on tumor to control it –Doses to nearby tissues within tolerances Inherent conflict between higher target dose and safety of critical healthy tissues

Optimization Limitations Optimization has made critical contributions to radiation therapy planning, but it is not a perfect fit to the dose tradeoff issues Optimization means finding a solution that minimizes (or maximizes) one function of the decision variables –Usually subject to constraints on decision choices Multiobjective optimization methods do exist, but use a sequence of single objective opts Any optimization is only practical if mathematical form of the objectives and constraints permits tractability

Interactive Sequence of Solutions Keep Limitations usually result in an interactive sequence of optimizations to find a plan suitable to physicians and dosiometrists Clinicians use graphic methods (DVH and isodose) to modify opt until they find one they like

Steerability Define steerability as the degree to which the optimization model and solution procedure are convenient for this sort of guided meta- search Purpose of this talk is to pose guidelines This interactive search is often long and frustrating –Inherently indirect as clinician changes input to an underlying optimization in order to guide it towards an acceptable plan

Typical Ingredients in Opt Models Assume the beam angles are fixed Decision variable = intensity of angle j, beamlet g Dose at point i is where are pre- computed unit dose coefficients Constraints: –Min tumor dose –Tumor homogeneity –Min 2nd target dose –Max healthy tissue dose –Dose-volume limits on healthy dose

Penalties & Importance Factors The system of constraints for given cases is almost always infeasible, i.e. there is no solution x Leads to a penalized violation format reducing all to one score to be minimized

Penalties & Importance Factors Penalty forms –Squared violation –Absolute violation –Piecewise linear violation

Optimization with a Single Score Single score fairly tractable for optimization –Unconstrained except for nonnegativity of x –Differentiable if squared penalty is used –Local minima (best only among those near) arise with dose-volume constraints but manageable Gradient methods solve quickly with squared Simulated annealing follows randomized search that adopts generated x-changes if improving & even if not with probability > 0

Steerability with a Single Score Claim the single score model is relatively poor on steerability –May input maxdose of 35 Gy in hopes of getting 45 Gy –Manipulating importance factors by hand has no guarantee of convergence –Difficult to predict what will change with requirement relaxation or tightening Will use single score to illustrate some issues

Issue 1: Meaningful Start Steered searches must start somewhere, even when constraints are inconsistent Single score model is satisfactory in this regard because constraints are enforced only through penalization in the objective function G1 Meaningful Start. Underlying optimization in a steered interactive search should guarantee a meaningful solution even if constraints are violated

Issue 2: Parameter Relevance Steering in the single score model is primarily via changing values of importance factors –This steering is indirect –Arbitrary numerical quantities without clinical import or predictable impact –Difficult and frustrating to manipulate G2 Parameter Relevance. Parameters manipulated in a steered interactive search should be meaningful to the application user

Issue 3: Objective Relevance In any optimization, relaxing (resp tightening) a requirement can only help (resp hurt) the optimal objective function value –That is, sign of impact is predictable –Local optima can confuse, but not usually too much True for single score, but impact is on the total score not on clinically relevant outcomes G3 Objective Relevance. Underlying optimization in a steered interactive search should have an objective function value meaningful to the application user

Issue 4: Hard Constraints In the single score model, all constraints are soft, i.e. weighted but not required –Hard constraints are ones explicitly enforced –Required with e.g. dose to cord <= 45 Gy Increasing may fail with squared penalty G4 Hard Constraints. The underlying optimization in a steered interactive search should be able to enforce hard constraints (or prove their inconsistency)

Issue 5: Efficient Frontier If we think of all soft constraints as objectives, we should seek a solution on the efficient frontier –No objective can be improved without hurting at least 1 other tumor dose protection of healthy tissue efficient frontier dominated solution G5 Efficient Frontier. The underlying optimization in a steered interactive search should produce a solution on the efficient frontier of soft constraints at every round

Issue 5: Efficient Frontier If 2 constraints can be simultaneously satisfied, minimizing violation may not give efficient frontier tumor dose protection of healthy tissue If 2 constraints are inconsistent an efficient solution can be obtained by minimizing violation tumor dose protection of healthy tissue

Better Paradigm: Multiobj Opt Good start: Hamacher and Kufer, “Inverse radiation therapy planning-a multiple objective optimization approach”, Discrete Applied Mathematices 118, , Considers lower bounds on target(s), upper limit on healthy tissues (but no dose-volume) –Implies opts are Linear Programs (highly tractable) Each round optimizes some weighted sum of objectives holding each to a hard limit –Optimizing instead of minimizing violation keeps solutions on efficient frontier

Better Paradigm: Multiobj Opt Paper actually proposes an automated search of the efficient frontier –Returns a collection of candidate plans Could be adapted to provide a good basis for interactive steering 1.Add some form of dose-volume constraints without conceding too much tractability 2.Use any desired starting solution procedure. Perhaps single score, or maximizing target doses for fixed healthy tissue limits (which has to be feasible) 3.At each round, select (a) criteria to focus upon (by significantly escalating their weights) and/or (b) hard bound values to tighten or relax

Better Paradigm: Multiobj Opt G1: Meaningful Start: Your choice G2: Parameter Relevance: Primarily changes in hard limits G3: Objective Relevance: Escalated weights link hard limit modification to expected changes in other criteria G4: Hard Constraints: Inherent with fixed limits G5: Efficient Frontier: Automatic with weighted sum optimization