Two-Stage Stochastic Optimization for the Allocation of Medical Assets in Steady State Combat Operations



Similar documents
Cost Models for Vehicle Routing Problems Stanford Boulevard, Suite 260 R. H. Smith School of Business

Chapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints

BIG DATA PROBLEMS AND LARGE-SCALE OPTIMIZATION: A DISTRIBUTED ALGORITHM FOR MATRIX FACTORIZATION

A Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem

Chapter 11 Monte Carlo Simulation

A Weighted-Sum Mixed Integer Program for Bi-Objective Dynamic Portfolio Optimization

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows

A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution. Bartosz Sawik

Joint Ground and Air Emergency Medical Services Coverage Models: A Greedy Heuristic Solution Approach. Revised: December 2009

Calculating P-Values. Parkland College. Isela Guerra Parkland College. Recommended Citation

Royal Flying Doctor Service Essential Aspects of Aeromedical Retrieval

The manual for SANET V4.1 Beta runs on ArcGIS10 & ArcGIS10.1 (revised on 2013/2/9) SANET TEAM

Approximation Algorithms

A Fuel Cost Comparison of Electric and Gas-Powered Vehicles

A Branch-Cut-and-Price Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions

Re-optimization of Rolling Stock Rotations

Optimal Gateway Selection in Multi-domain Wireless Networks: A Potential Game Perspective

Icepak High-Performance Computing at Rockwell Automation: Benefits and Benchmarks

Appendix: Simple Methods for Shift Scheduling in Multi-Skill Call Centers

A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem

Confidence Intervals for the Difference Between Two Means

Support Vector Machines with Clustering for Training with Very Large Datasets

Impact of Remote Control Failure on Power System Restoration Time

INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models

Airport Planning and Design. Excel Solver

Two objective functions for a real life Split Delivery Vehicle Routing Problem

Abstract. 1. Introduction. Caparica, Portugal b CEG, IST-UTL, Av. Rovisco Pais, Lisboa, Portugal

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

THE EXPAND PARALLEL FILE SYSTEM A FILE SYSTEM FOR CLUSTER AND GRID COMPUTING. José Daniel García Sánchez ARCOS Group University Carlos III of Madrid

Hardware-Aware Analysis and. Presentation Date: Sep 15 th 2009 Chrissie C. Cui

An Optimization Approach for Cooperative Communication in Ad Hoc Networks

Linear Programming. March 14, 2014

Flood Risk Analysis considering 2 types of uncertainty

A Constraint Programming based Column Generation Approach to Nurse Rostering Problems

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

R u t c o r Research R e p o r t. A Method to Schedule Both Transportation and Production at the Same Time in a Special FMS.

Load balancing in a heterogeneous computer system by self-organizing Kohonen network

6 Scalar, Stochastic, Discrete Dynamic Systems

2 Sample t-test (unequal sample sizes and unequal variances)

Journal of Theoretical and Applied Information Technology 20 th July Vol.77. No JATIT & LLS. All rights reserved.

Binary Image Reconstruction

Models for Ambulance Planning on the Strategic and the Tactical Level

Strategic Online Advertising: Modeling Internet User Behavior with

Mining Social Network Graphs

Chapter 3 RANDOM VARIATE GENERATION

FPGA area allocation for parallel C applications

Protein Protein Interaction Networks

ΤΕΙ Κρήτης, Παράρτηµα Χανίων

Benchmark Hadoop and Mars: MapReduce on cluster versus on GPU

Simple Linear Regression Inference

Big Data & Scripting Part II Streaming Algorithms

Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines

Simple Methods for Shift Scheduling in Multi-Skill Call Centers

THE INTEGRATED PERFORMANCE MODELING ENVIRONMENT - SIMULATING HUMAN-SYSTEM PERFORMANCE. David Dahn K. Ronald Laughery

Big Data Optimization at SAS

Joint Location-Two-Echelon-Inventory Supply chain Model with Stochastic Demand

Two-Sample T-Tests Allowing Unequal Variance (Enter Difference)

High Performance Computing in CST STUDIO SUITE

How To Understand And Solve A Linear Programming Problem

Parallel Computing for Option Pricing Based on the Backward Stochastic Differential Equation

MULTIPLE-OBJECTIVE DECISION MAKING TECHNIQUE Analytical Hierarchy Process

Detection of changes in variance using binary segmentation and optimal partitioning

Pricing and calibration in local volatility models via fast quantization

Student Project Allocation Using Integer Programming

HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE

Dave Sly, PhD, MBA, PE Iowa State University

A Simple Inventory System

Profit Forecast Model Using Monte Carlo Simulation in Excel

24. The Branch and Bound Method

SINGLE-STAGE MULTI-PRODUCT PRODUCTION AND INVENTORY SYSTEMS: AN ITERATIVE ALGORITHM BASED ON DYNAMIC SCHEDULING AND FIXED PITCH PRODUCTION

Optimization Theory for Large Systems

PERFORMANCE ENHANCEMENTS IN TreeAge Pro 2014 R1.0

Calculating the Probability of Returning a Loan with Binary Probability Models

The number of marks is given in brackets [ ] at the end of each question or part question. The total number of marks for this paper is 72.

A Non-Linear Schema Theorem for Genetic Algorithms

Polynomial Neural Network Discovery Client User Guide

Pricing complex options using a simple Monte Carlo Simulation

Practical Guide to the Simplex Method of Linear Programming

Scheduling Single Machine Scheduling. Tim Nieberg

Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS

Computing Load Aware and Long-View Load Balancing for Cluster Storage Systems

Generating Random Numbers Variance Reduction Quasi-Monte Carlo. Simulation Methods. Leonid Kogan. MIT, Sloan , Fall 2010

Optimization: Continuous Portfolio Allocation

Transcription:

Two-Stage Stochastic Optimization for the Allocation of Medical Assets in Steady State Combat Operations LTC(P) Larry Fulton, Ph.D. Leon Lasdon, Ph.D. Reuben McDaniel, Jr., Ed.D. Barbara Wojcik, Ph.D.

+ Purpose + Motivation + Literature + Context + Simulation + Optimization + Results + Conclusions + Limitations and Future Work Outline

Purpose + Purpose: To investigate algorithms for determining the optimal site locations for medical assets in stability operations Motivation + Iraq base realignment + Afghanistan base realignment + Army Experimentation

Literature + Swain, Revelle, and Bergman (1971) + Similarly, Revelle & Hogan (1989) + Marianov and Taborga (2001) + Batta and Mannur (1990) + Aly and White (1978) + Neebe (1988) + Eaton, Sanchez, Ricardo, and Morgan (1986) + Silva and Serra (2008) + Geoffrion and Graves (1974) + Bouma (2005) + Santoso, Ahmed, Goetschalckx, and Shapiro (2005) + Snyder (2006)

Simple Overview Evac site hospital Evac site 1.0 Evac site 1.4* time 1.4* time 1.1 1.0* time 1.0* time 1.4 18 hrs 1.4 1.0 hospital 1.1 1.1 Evac site 1.0 hospital

Scenario Parameters / Assumptions + OIF-like scenario + 10 possible hospital locations, 5 to be selected. + 20 possible evacuation locations, 10 to be selected + Feasible locations randomly generated over grid (size of Iraq) + Four areas with casualty clusters (e.g., brigades) + Frequency distribution assigns the casualties occurring within each area based on unit mission and priority (e.g., main effort or supporting effort)

Hospital Parameters / Assumptions + Hospitalization sites = subset of evacuation sites + Total beds for all hospital designs by type were: + 1,000 minimal care ward (MCW) beds (200 per hospital), + 1,000 intermediate care ward (ICW) beds (200 per hospital) + 240 intensive care unit (ICU) beds (48 per hospital); + Bed types need not be equally distributed among hospitals. + Beds represent those available in 5 x 248-bed combat support hospitals with attached minimal care capability. + Assumption: over the relevant range, hospital bed availability (e.g., percent unoccupied) is 25% per type leaving available a daily average of 250 MCW beds, 250 ICW beds, and 60 ICU beds.

Vehicle Parameters / Assumptions + Based on operating characteristics of the platforms and limitations of human performance, a ground ambulance can conduct at most 10 lifts/day and air ambulances 5 lifts/day. + Ground ambulances are assumed to operate uniformly on the interval 45 +/-15 nautical miles per hour (accounting for patient loading, unloading, circuitous routing, etc. ) + Air ambulances are assumed to operate at 95 +/- 20 nautical miles per hour (again, accounting for patient loading, unloading, threat, terrain, etc.).

Casualty Generation + Inverse CDF sampling to 1. Determine brigade center {n,o} where casualty-producing event occurred. 2. Determine random location around brigade where casualty-producing event occurred. 3. Determine number of casualties at location. 4. Determine casualty severity. 5. Determine casualty bed type.

Casualty Distributions 1. Determine brigade center {n,o} where casualty-producing event occurred. Grid {n,o} % of Casualties P(X<=x) {100,100} 20%.20 {400,100} 35%.55 {100,400} 25%.80 {400,400} 20% 1.00

Casualty Locations

Casualty Numbers 3. Determine number of casualties at location. Fulton, McMurry, & Kerr (2009). Monte Carlo Simulation of Air Ambulance Requirements.., Military Medicine, In Press # Patients** P(X=x) 1 patient.574 2 patients.360 3 patients.050 4 patients.016 ** The number of patients is subject to a DoE lethality multiplier.

Casualty Severity (Path Weights) 4. Determine casualty severity and bed assignment + Sample from OIF ISS data + Sample from ISS fatality distribution (National Trauma Databank, 2007) + Weight path by geometric expectation (inverse of survival probability). + Assign bed category based on ISS scores groupings. Injury Severity Score P(X=x) 1-8.45 9-15.32 16-24.12 >24.11 Survival by Injury Severity Score (ISS), 2007 ISS P(Fatal) P(Non-Fatal) Penalty Weight 1-8.01.99 1.01 9-15.02.98 1.02 16-24.05.95 1.05 >24.29.71 1.41

Design of Experiment Factors Design: 3 4-2 III, I=AB2 C, I=BCD Main Effects Clear + A: Lethality multiplier, {1.0, 1.5, 2.0} + B: Maximum casualty distance from center of unit, {50NM, 100NM, 150NM} + C: Percent of ground ambulance use, {.2,.3,.4} + D: Days in which casualty numbers might be experienced, {4, 7, 10}

Simulation Runs + Based on an initial simulation run of size n=100, the standard deviation for the time to travel along the network was.629 hours. + All 9 runs with their estimated 1,719 casualties should provide a 95% confidence interval around mean transport time of +/- 2 minutes.

Sets + T = scenarios for evaluation with index + I = set of locations where injuries may occur with index + J = set of candidate helicopter evacuation sites with index + K = set of candidate hospital sites with index + L = type of bed requirement for a patient (minimal, intermediate, and intensive care) with + M = type of evacuation asset, ground or air

Problem Data p t = probability that scenario t occurs (probability distribution) a it = injury severity weight of most critically-injured patient departing from site i for scenario t, assigned stochastically b ijt = distance between injury location i and evacuation site j for scenario t c ikt = distance between injury location i and hospital location k for scenario t d jkmt = speed of transport from j to k by vehicle m for scenario t, stochastic e it = number of total patients injured at location i for scenario t, stochastic f l = the number of patients with type l bed requirements ecap mt = capacity for patient evacuation by m-type vehicles hcap lt = capacity for hospital acceptance of l-type patients enod jt = evacuation node capacity for each node j hnod kt = hospital node capacity for each node k u = maximum number of hospitalization sites to be occupied v = maximum number of evacuation sites to be occupied wx jt = percent ground ambulances required for each evacuation site

Decision Variables + x ijklmt = number of patients traveling from injury location i with bed-type requirement l on vehicle m to hospital site k by a vehicle and crew located at evacuation site j for scenario t + y j = 1 if air evacuation site j is chosen, 0 otherwise + z k = 1 if hospitalization site l is chose, 0 otherwise

Constraint 1 j k l m x ijklmt = e it, i, t Synopsis: All patients are evacuated LHS: total number of casualties who are transported RHS: the number of casualties specified as originating at location i in scenario t.

i j k l Constraint 2 x ijklmt ecap mt, m, t Synopsis: Patients traveling the network cannot exceed evacuation capacity. LHS: Number of patients traveling the network RHS: Evacuation system capacity by vehicle by scenario Note: RHS may be set large (open) for requirements estimation.

i j k m Constraint 3 x ijklmt hcap lt, l, t Synopsis: Patients traveling the network cannot exceed hospitalization capacity. LHS: Number of patients traveling the network RHS: Hospitalization system capacity by bed by scenario Note: RHS may be set large (open) for requirements estimation.

Constraints 4 & 5 i k l m i j l m x x ijklmt ijklmt <= <= enod hnod jt kt * y * y j, j, t k, k, t Two constraints allow for node throughput limits by restricting capacity at either evacuation or hospitalization nodes. To allow unconstrained nodes and post-hoc determination of what is needed, both enod and hnod might be set large.

xijkl, m= i j k l m Constraint 6 'G',t wx jt * i j k l m x ijklmt When evacuation capacity is large such as in stability operations, solutions will generally select the military's preferred and primary source of evacuation assets, the air ambulance. Weather sometimes limits the ability of aircraft to fly, however. To account for limitations in use of air ambulances, an additional constraint was used. The left hand side insures that the evacuations conducted by ground ambulance are greater than a percentage of total evacuations at each evacuation site j., t

Constraints 7 and 8 j y = v, z = j k The total number of all open evacuation sites and hospitals are limited using the following constraints. For this analysis, v represents the available evacuation sites, while u represents the available hospitalization sites. One can see that the decision variables, y and z, are not indexed by scenario. In this way, only a single set of open nodes are chosen which is necessary to find the optimal over all scenarios. k u

Constraints 9, 10, and 11 x jikt 0, y j {0,1}, z k {0,1} Finally, the flow variables x must be nonnegative while the others must be binary. If certain nodes must remain open, one can add constraints forcing their associated y or z value to 1.

Objective Function Min O p ( a itxijklmt (bijt + = t t j k l m i c ikt )/(d The objective is to minimize the expectation over all scenarios of the total, penaltyweighted time traveled by all patients. O sums the penalty-weighted time for evacuating patients via helicopter or ground ambulance along all paths for all scenarios. If some candidate locations are fixed, one simply does not define variables for these indices. ijkmt ))

Solver + GAMs provided the platform for both the simulation and the optimization. The simulation leveraged inverse CDF sampling while the optimization model was solved via the IBM-based OSL solver. + GAMS provides reasonable capability for simulation via pseudo-random number generation, seed assignment, probability functions, and programming flow control. + GAMS also provides an excellent optimization modeling platform.

Complexity + Prior to optimization, the generation of the model (the stage 1 simulation runs) took 256MB of memory and 37.7 seconds for initialization and initial simulation runs. + The model contained 1,234 single equations with 1,090 rows and 864,031 columns, 2.6 million single variables (30 discrete), and 6.0 million non-zero elements. + On a Dell XPS 1730 laptop with 3.8 GHZ Intel Core 2 Extreme processor with 4 GB of RAM and twin Raid 0 solid state hard drives, the OLS solver completed 3,400 simplex iterations before proceeding to branch and bound. After 43,225 iterations and 19.3 minutes, the OSL solver produced an integer optimal solution meeting the.01 optimality criterion.

Solution

Results, Allocation Average Patients Moved: 203.60 j=evacuation site k=hospitalization site m=vehicle type l=patient type m=g, Avg. Patients Moved by Ground m=a, Avg. Patients Moved by Air k=h1, Avg. Patients Moved to Hosp. 1 k=h2, Avg. Patients Moved to Hosp. 2 k=h4, Avg. Patients Moved to Hosp. 4 k=h7, Avg. Patients Moved to Hosp. 7 k=h9, Avg. Patients Moved to Hosp. 9 P(j=E* m=g) Ground Ambulance Asset Allocation at Site j P(j=E* m=a) Air Ambulance Asset Allocation at Site j j=e1, Evac. Site 1 6.75 34.57 40.66 0.67 22% 53 20% 12 j=e2, Evac. Site 2 5.17 30.12 2.08 32.55 0.67 17% 41 17% 10 j=e3, Evac. Site 3 0.97 7.28 3.54 4.72 3% 8 4% 3 j=e4, Evac. Site 4 0.46 3.54 4.00 1% 4 2% 1 j=e5, Evac. Site 5 2.98 15.53 1.22 17.29 10% 23 9% 5 j=e7, Evac. Site 7 2.90 18.19 20.43 0.67 9% 23 11% 6 j=e12, Evac. Site 12 2.15 13.64 15.79 7% 17 8% 5 j=e13, Evac. Site 13 4.71 26.50 15.44 15.77 15% 37 15% 9 j=e15, Evac. Site 15 0.44 2.67 3.00 0.11 1% 3 2% 1 j=e20, Evac. Site 20 4.10 20.92 12.44 0.24 12.33 13% 32 12% 7 Totals 30.63 172.97 66.70 50.38 20.90 36.74 28.88 240 60 E(l=MCW column) 26.89 142.55 55.06 45.27 17.68 26.59 24.84 169.4 Avg. Patients Moved to MCW E(l=ICW column) 1.62 17.41 6.78 3.56 1.78 5.02 1.89 19.0 Avg. Patients Moved to ICW E(l=ICU column) 2.12 13.01 4.87 1.56 1.44 5.13 2.15 15.1 Avg. Patients Moved to ICU P(column l=mcw) 16% 84% 32% 27% 10% 16% 15% 100% % Patients Moved to MCW P(column l=icw) 9% 21% 36% 19% 9% 26% 10% 100% % Patients Moved to ICW P(column l=icu) 14% 51% 32% 10% 10% 34% 14% 100% % Patients Moved to ICU MCW Asset Allocation for Hospital k 325 267 104 157 147 1000 Total MCW beds in scenario ICW Asset Allocation for Hospital k 356 187 93 264 99 1000 Total ICW beds in scenario ICU Asset Allocation for Hospital k 80 26 24 85 35 250 Total ICU beds in scenario

Main Effects of DOE Factors Type III Sum of Source Squares df Mean Square F p Model 2921.388 a 9 324.599 366.793 <.001 Lethality 6.160 2 3.080 3.481.031 Radius 7.348 2 3.674 4.152.016 % ground 1.908 2.954 1.078.341 Days 3.506 2 1.753 1.981.139 Error 629.209 711.885 Total 3550.596 720 a. R Squared =.823 (Adjusted R Squared =.821)

Limitations and Future Work Improvement of distributions Multi-period extension (possibly), e.g., x d,i,t Addition of set items (e.g., C-130, FST) MCO extension by indicing over phase, e.g., x p,d,i,t

Questions?