Two-Stage Stochastic Optimization for the Allocation of Medical Assets in Steady State Combat Operations
|
|
|
- Blake Solomon Gaines
- 10 years ago
- Views:
Transcription
1 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.
2 + Purpose + Motivation + Literature + Context + Simulation + Optimization + Results + Conclusions + Limitations and Future Work Outline
3 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
4 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)
5 Simple Overview Evac site hospital Evac site 1.0 Evac site 1.4* time 1.4* time * time 1.0* time hrs hospital Evac site 1.0 hospital
6 Scenario Parameters / Assumptions + OIF-like scenario + 10 possible hospital locations, 5 to be selected 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)
7 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) 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.
8 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.).
9 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.
10 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
11 Casualty Locations
12 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 patients patients patients.016 ** The number of patients is subject to a DoE lethality multiplier.
13 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) >24.11 Survival by Injury Severity Score (ISS), 2007 ISS P(Fatal) P(Non-Fatal) Penalty Weight >
14 Design of Experiment Factors Design: 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}
15 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.
16 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
17 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
18 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
19 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.
20 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.
21 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.
22 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.
23 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
24 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
25 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.
26 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 ))
27 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.
28 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.
29 Solution
30 Results, Allocation Average Patients Moved: 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 % 53 20% 12 j=e2, Evac. Site % 41 17% 10 j=e3, Evac. Site % 8 4% 3 j=e4, Evac. Site % 4 2% 1 j=e5, Evac. Site % 23 9% 5 j=e7, Evac. Site % 23 11% 6 j=e12, Evac. Site % 17 8% 5 j=e13, Evac. Site % 37 15% 9 j=e15, Evac. Site % 3 2% 1 j=e20, Evac. Site % 32 12% 7 Totals E(l=MCW column) Avg. Patients Moved to MCW E(l=ICW column) Avg. Patients Moved to ICW E(l=ICU column) 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 Total MCW beds in scenario ICW Asset Allocation for Hospital k Total ICW beds in scenario ICU Asset Allocation for Hospital k Total ICU beds in scenario
31 Main Effects of DOE Factors Type III Sum of Source Squares df Mean Square F p Model a <.001 Lethality Radius % ground Days Error Total a. R Squared =.823 (Adjusted R Squared =.821)
32 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
33 Questions?
Cost Models for Vehicle Routing Problems. 8850 Stanford Boulevard, Suite 260 R. H. Smith School of Business
0-7695-1435-9/02 $17.00 (c) 2002 IEEE 1 Cost Models for Vehicle Routing Problems John Sniezek Lawerence Bodin RouteSmart Technologies Decision and Information Technologies 8850 Stanford Boulevard, Suite
Chapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints
Chapter 6 Linear Programming: The Simplex Method Introduction to the Big M Method In this section, we will present a generalized version of the simplex method that t will solve both maximization i and
BIG DATA PROBLEMS AND LARGE-SCALE OPTIMIZATION: A DISTRIBUTED ALGORITHM FOR MATRIX FACTORIZATION
BIG DATA PROBLEMS AND LARGE-SCALE OPTIMIZATION: A DISTRIBUTED ALGORITHM FOR MATRIX FACTORIZATION Ş. İlker Birbil Sabancı University Ali Taylan Cemgil 1, Hazal Koptagel 1, Figen Öztoprak 2, Umut Şimşekli
A Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem
A Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem Clara Novoa Department of Engineering and Technology Texas State University 601 University Drive San Marcos, TX 78666 [email protected]
Chapter 11 Monte Carlo Simulation
Chapter 11 Monte Carlo Simulation 11.1 Introduction The basic idea of simulation is to build an experimental device, or simulator, that will act like (simulate) the system of interest in certain important
A Weighted-Sum Mixed Integer Program for Bi-Objective Dynamic Portfolio Optimization
AUTOMATYKA 2009 Tom 3 Zeszyt 2 Bartosz Sawik* A Weighted-Sum Mixed Integer Program for Bi-Objective Dynamic Portfolio Optimization. Introduction The optimal security selection is a classical portfolio
Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows
TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents
A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution. Bartosz Sawik
Decision Making in Manufacturing and Services Vol. 4 2010 No. 1 2 pp. 37 46 A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution Bartosz Sawik Abstract.
Joint Ground and Air Emergency Medical Services Coverage Models: A Greedy Heuristic Solution Approach. Revised: December 2009
Joint Ground and Air Emergency Medical Services Coverage Models: A Greedy Heuristic Solution Approach Elif Tokar Erdemir 1, Rajan Batta 2,3,5, Peter A. Rogerson 2,4,5, Alan Blatt 2, and Marie Flanigan
Calculating P-Values. Parkland College. Isela Guerra Parkland College. Recommended Citation
Parkland College A with Honors Projects Honors Program 2014 Calculating P-Values Isela Guerra Parkland College Recommended Citation Guerra, Isela, "Calculating P-Values" (2014). A with Honors Projects.
Royal Flying Doctor Service Essential Aspects of Aeromedical Retrieval
Royal Flying Doctor Service Essential Aspects of Aeromedical Retrieval Modes Of Transport Session Objectives Consider the requirements for the ideal mode of transport Discuss the advantages and disadvantages
The manual for SANET V4.1 Beta runs on ArcGIS10 & ArcGIS10.1 (revised on 2013/2/9) SANET TEAM
The manual for SANET V4.1 Beta runs on ArcGIS10 & ArcGIS10.1 (revised on 2013/2/9) SANET TEAM Table of Contents page 1. About SANET: 2 1.1 Functions and Versions 1.2 Copyright 1.3 Use conditions 1.4 Citation
Approximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
A Fuel Cost Comparison of Electric and Gas-Powered Vehicles
$ / gl $ / kwh A Fuel Cost Comparison of Electric and Gas-Powered Vehicles Lawrence V. Fulton, McCoy College of Business Administration, Texas State University, [email protected] Nathaniel D. Bastian, University
A Branch-Cut-and-Price Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions
A Branch-Cut-and-Price Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions Marc Goerigk, Bob Grün, and Philipp Heßler Fachbereich Mathematik, Technische Universität
Re-optimization of Rolling Stock Rotations
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany RALF BORNDÖRFER 1, JULIKA MEHRGARDT 1, MARKUS REUTHER 1, THOMAS SCHLECHTE 1, KERSTIN WAAS 2 Re-optimization
Optimal Gateway Selection in Multi-domain Wireless Networks: A Potential Game Perspective
Optimal Gateway Selection in Multi-domain Wireless Networks: A Potential Game Perspective Yang Song, Starsky H.Y. Wong, and Kang-Won Lee Wireless Networking Research Group IBM T. J. Watson Research Center
Icepak High-Performance Computing at Rockwell Automation: Benefits and Benchmarks
Icepak High-Performance Computing at Rockwell Automation: Benefits and Benchmarks Garron K. Morris Senior Project Thermal Engineer [email protected] Standard Drives Division Bruce W. Weiss Principal
Appendix: Simple Methods for Shift Scheduling in Multi-Skill Call Centers
MSOM.1070.0172 Appendix: Simple Methods for Shift Scheduling in Multi-Skill Call Centers In Bhulai et al. (2006) we presented a method for computing optimal schedules, separately, after the optimal staffing
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical
Confidence Intervals for the Difference Between Two Means
Chapter 47 Confidence Intervals for the Difference Between Two Means Introduction This procedure calculates the sample size necessary to achieve a specified distance from the difference in sample means
Support Vector Machines with Clustering for Training with Very Large Datasets
Support Vector Machines with Clustering for Training with Very Large Datasets Theodoros Evgeniou Technology Management INSEAD Bd de Constance, Fontainebleau 77300, France [email protected] Massimiliano
Impact of Remote Control Failure on Power System Restoration Time
Impact of Remote Control Failure on Power System Restoration Time Fredrik Edström School of Electrical Engineering Royal Institute of Technology Stockholm, Sweden Email: [email protected] Lennart
INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models
Integer Programming INTEGER PROGRAMMING In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is
Airport Planning and Design. Excel Solver
Airport Planning and Design Excel Solver Dr. Antonio A. Trani Professor of Civil and Environmental Engineering Virginia Polytechnic Institute and State University Blacksburg, Virginia Spring 2012 1 of
Two objective functions for a real life Split Delivery Vehicle Routing Problem
International Conference on Industrial Engineering and Systems Management IESM 2011 May 25 - May 27 METZ - FRANCE Two objective functions for a real life Split Delivery Vehicle Routing Problem Marc Uldry
Abstract. 1. Introduction. Caparica, Portugal b CEG, IST-UTL, Av. Rovisco Pais, 1049-001 Lisboa, Portugal
Ian David Lockhart Bogle and Michael Fairweather (Editors), Proceedings of the 22nd European Symposium on Computer Aided Process Engineering, 17-20 June 2012, London. 2012 Elsevier B.V. All rights reserved.
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
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
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 Contents 2 The ARCOS Group. Expand motivation. Expand
Hardware-Aware Analysis and. Presentation Date: Sep 15 th 2009 Chrissie C. Cui
Hardware-Aware Analysis and Optimization of Stable Fluids Presentation Date: Sep 15 th 2009 Chrissie C. Cui Outline Introduction Highlights Flop and Bandwidth Analysis Mehrstellen Schemes Advection Caching
An Optimization Approach for Cooperative Communication in Ad Hoc Networks
An Optimization Approach for Cooperative Communication in Ad Hoc Networks Carlos A.S. Oliveira and Panos M. Pardalos University of Florida Abstract. Mobile ad hoc networks (MANETs) are a useful organizational
Linear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
Flood Risk Analysis considering 2 types of uncertainty
US Army Corps of Engineers Institute for Water Resources Hydrologic Engineering Center Flood Risk Analysis considering 2 types of uncertainty Beth Faber, PhD, PE Hydrologic Engineering Center (HEC) US
A Constraint Programming based Column Generation Approach to Nurse Rostering Problems
Abstract A Constraint Programming based Column Generation Approach to Nurse Rostering Problems Fang He and Rong Qu The Automated Scheduling, Optimisation and Planning (ASAP) Group School of Computer Science,
Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.
1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that
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.
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 Navid Hashemian a Béla Vizvári b RRR 3-2011, February 21, 2011 RUTCOR Rutgers
Load balancing in a heterogeneous computer system by self-organizing Kohonen network
Bull. Nov. Comp. Center, Comp. Science, 25 (2006), 69 74 c 2006 NCC Publisher Load balancing in a heterogeneous computer system by self-organizing Kohonen network Mikhail S. Tarkov, Yakov S. Bezrukov Abstract.
6 Scalar, Stochastic, Discrete Dynamic Systems
47 6 Scalar, Stochastic, Discrete Dynamic Systems Consider modeling a population of sand-hill cranes in year n by the first-order, deterministic recurrence equation y(n + 1) = Ry(n) where R = 1 + r = 1
2 Sample t-test (unequal sample sizes and unequal variances)
Variations of the t-test: Sample tail Sample t-test (unequal sample sizes and unequal variances) Like the last example, below we have ceramic sherd thickness measurements (in cm) of two samples representing
Journal of Theoretical and Applied Information Technology 20 th July 2015. Vol.77. No.2 2005-2015 JATIT & LLS. All rights reserved.
EFFICIENT LOAD BALANCING USING ANT COLONY OPTIMIZATION MOHAMMAD H. NADIMI-SHAHRAKI, ELNAZ SHAFIGH FARD, FARAMARZ SAFI Department of Computer Engineering, Najafabad branch, Islamic Azad University, Najafabad,
Binary Image Reconstruction
A network flow algorithm for reconstructing binary images from discrete X-rays Kees Joost Batenburg Leiden University and CWI, The Netherlands [email protected] Abstract We present a new algorithm
Models for Ambulance Planning on the Strategic and the Tactical Level
Noname manuscript No. (will be inserted by the editor) Models for Ambulance Planning on the Strategic and the Tactical Level J. Theresia van Essen Johann L. Hurink Stefan Nickel Melanie Reuter Received:
Strategic Online Advertising: Modeling Internet User Behavior with
2 Strategic Online Advertising: Modeling Internet User Behavior with Patrick Johnston, Nicholas Kristoff, Heather McGinness, Phuong Vu, Nathaniel Wong, Jason Wright with William T. Scherer and Matthew
Mining Social Network Graphs
Mining Social Network Graphs Debapriyo Majumdar Data Mining Fall 2014 Indian Statistical Institute Kolkata November 13, 17, 2014 Social Network No introduc+on required Really? We s7ll need to understand
Chapter 3 RANDOM VARIATE GENERATION
Chapter 3 RANDOM VARIATE GENERATION In order to do a Monte Carlo simulation either by hand or by computer, techniques must be developed for generating values of random variables having known distributions.
FPGA area allocation for parallel C applications
1 FPGA area allocation for parallel C applications Vlad-Mihai Sima, Elena Moscu Panainte, Koen Bertels Computer Engineering Faculty of Electrical Engineering, Mathematics and Computer Science Delft University
Protein Protein Interaction Networks
Functional Pattern Mining from Genome Scale Protein Protein Interaction Networks Young-Rae Cho, Ph.D. Assistant Professor Department of Computer Science Baylor University it My Definition of Bioinformatics
ΤΕΙ Κρήτης, Παράρτηµα Χανίων
ΤΕΙ Κρήτης, Παράρτηµα Χανίων ΠΣΕ, Τµήµα Τηλεπικοινωνιών & ικτύων Η/Υ Εργαστήριο ιαδίκτυα & Ενδοδίκτυα Η/Υ Modeling Wide Area Networks (WANs) ρ Θεοδώρου Παύλος Χανιά 2003 8. Modeling Wide Area Networks
Benchmark Hadoop and Mars: MapReduce on cluster versus on GPU
Benchmark Hadoop and Mars: MapReduce on cluster versus on GPU Heshan Li, Shaopeng Wang The Johns Hopkins University 3400 N. Charles Street Baltimore, Maryland 21218 {heshanli, shaopeng}@cs.jhu.edu 1 Overview
Simple Linear Regression Inference
Simple Linear Regression Inference 1 Inference requirements The Normality assumption of the stochastic term e is needed for inference even if it is not a OLS requirement. Therefore we have: Interpretation
Big Data & Scripting Part II Streaming Algorithms
Big Data & Scripting Part II Streaming Algorithms 1, 2, a note on sampling and filtering sampling: (randomly) choose a representative subset filtering: given some criterion (e.g. membership in a set),
Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines
Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines Maher Rebai University of Technology of Troyes Department of Industrial Systems 12 rue Marie Curie, 10000 Troyes France [email protected]
Simple Methods for Shift Scheduling in Multi-Skill Call Centers
Simple Methods for Shift Scheduling in Multi-Skill Call Centers Sandjai Bhulai, Ger Koole & Auke Pot Vrije Universiteit, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands Final version Abstract This
THE INTEGRATED PERFORMANCE MODELING ENVIRONMENT - SIMULATING HUMAN-SYSTEM PERFORMANCE. David Dahn K. Ronald Laughery
THE INTEGRATED PERFORMANCE MODELING ENVIRONMENT - SIMULATING HUMAN-SYSTEM PERFORMANCE David Dahn K. Ronald Laughery Micro Analysis and Design, Incorporated 4900 Pearl East Circle, Suite 201E Boulder, Colorado
Big Data Optimization at SAS
Big Data Optimization at SAS Imre Pólik et al. SAS Institute Cary, NC, USA Edinburgh, 2013 Outline 1 Optimization at SAS 2 Big Data Optimization at SAS The SAS HPA architecture Support vector machines
Joint Location-Two-Echelon-Inventory Supply chain Model with Stochastic Demand
Joint Location-Two-Echelon-Inventory Supply chain Model with Stochastic Demand Malek Abu Alhaj, Ali Diabat Department of Engineering Systems and Management, Masdar Institute, Abu Dhabi, UAE P.O. Box: 54224.
Two-Sample T-Tests Allowing Unequal Variance (Enter Difference)
Chapter 45 Two-Sample T-Tests Allowing Unequal Variance (Enter Difference) Introduction This procedure provides sample size and power calculations for one- or two-sided two-sample t-tests when no assumption
High Performance Computing in CST STUDIO SUITE
High Performance Computing in CST STUDIO SUITE Felix Wolfheimer GPU Computing Performance Speedup 18 16 14 12 10 8 6 4 2 0 Promo offer for EUC participants: 25% discount for K40 cards Speedup of Solver
How To Understand And Solve A Linear Programming Problem
At the end of the lesson, you should be able to: Chapter 2: Systems of Linear Equations and Matrices: 2.1: Solutions of Linear Systems by the Echelon Method Define linear systems, unique solution, inconsistent,
Parallel Computing for Option Pricing Based on the Backward Stochastic Differential Equation
Parallel Computing for Option Pricing Based on the Backward Stochastic Differential Equation Ying Peng, Bin Gong, Hui Liu, and Yanxin Zhang School of Computer Science and Technology, Shandong University,
MULTIPLE-OBJECTIVE DECISION MAKING TECHNIQUE Analytical Hierarchy Process
MULTIPLE-OBJECTIVE DECISION MAKING TECHNIQUE Analytical Hierarchy Process Business Intelligence and Decision Making Professor Jason Chen The analytical hierarchy process (AHP) is a systematic procedure
Detection of changes in variance using binary segmentation and optimal partitioning
Detection of changes in variance using binary segmentation and optimal partitioning Christian Rohrbeck Abstract This work explores the performance of binary segmentation and optimal partitioning in the
Pricing and calibration in local volatility models via fast quantization
Pricing and calibration in local volatility models via fast quantization Parma, 29 th January 2015. Joint work with Giorgia Callegaro and Martino Grasselli Quantization: a brief history Birth: back to
Student Project Allocation Using Integer Programming
IEEE TRANSACTIONS ON EDUCATION, VOL. 46, NO. 3, AUGUST 2003 359 Student Project Allocation Using Integer Programming A. A. Anwar and A. S. Bahaj, Member, IEEE Abstract The allocation of projects to students
HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE
HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE Subodha Kumar University of Washington [email protected] Varghese S. Jacob University of Texas at Dallas [email protected]
Dave Sly, PhD, MBA, PE Iowa State University
Dave Sly, PhD, MBA, PE Iowa State University Tuggers deliver to multiple locations on one trip, where Unit Load deliveries involve only one location per trip. Tugger deliveries are more complex since the
A Simple Inventory System
A Simple Inventory System Section 1.3 Discrete-Event Simulation: A First Course Section 1.3: A Simple Inventory System customers. demand items.. facility. order items.. supplier Distributes items from
Profit Forecast Model Using Monte Carlo Simulation in Excel
Profit Forecast Model Using Monte Carlo Simulation in Excel Petru BALOGH Pompiliu GOLEA Valentin INCEU Dimitrie Cantemir Christian University Abstract Profit forecast is very important for any company.
24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no
SINGLE-STAGE MULTI-PRODUCT PRODUCTION AND INVENTORY SYSTEMS: AN ITERATIVE ALGORITHM BASED ON DYNAMIC SCHEDULING AND FIXED PITCH PRODUCTION
SIGLE-STAGE MULTI-PRODUCT PRODUCTIO AD IVETORY SYSTEMS: A ITERATIVE ALGORITHM BASED O DYAMIC SCHEDULIG AD FIXED PITCH PRODUCTIO Euclydes da Cunha eto ational Institute of Technology Rio de Janeiro, RJ
Optimization Theory for Large Systems
Optimization Theory for Large Systems LEON S. LASDON CASE WESTERN RESERVE UNIVERSITY THE MACMILLAN COMPANY COLLIER-MACMILLAN LIMITED, LONDON Contents 1. Linear and Nonlinear Programming 1 1.1 Unconstrained
PERFORMANCE ENHANCEMENTS IN TreeAge Pro 2014 R1.0
PERFORMANCE ENHANCEMENTS IN TreeAge Pro 2014 R1.0 15 th January 2014 Al Chrosny Director, Software Engineering TreeAge Software, Inc. [email protected] Andrew Munzer Director, Training and Customer
Calculating the Probability of Returning a Loan with Binary Probability Models
Calculating the Probability of Returning a Loan with Binary Probability Models Associate Professor PhD Julian VASILEV (e-mail: [email protected]) Varna University of Economics, Bulgaria ABSTRACT The
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.
ADVANCED SUBSIDIARY GCE UNIT 4736/01 MATHEMATICS Decision Mathematics 1 THURSDAY 14 JUNE 2007 Afternoon Additional Materials: Answer Booklet (8 pages) List of Formulae (MF1) Time: 1 hour 30 minutes INSTRUCTIONS
A Non-Linear Schema Theorem for Genetic Algorithms
A Non-Linear Schema Theorem for Genetic Algorithms William A Greene Computer Science Department University of New Orleans New Orleans, LA 70148 bill@csunoedu 504-280-6755 Abstract We generalize Holland
Polynomial Neural Network Discovery Client User Guide
Polynomial Neural Network Discovery Client User Guide Version 1.3 Table of contents Table of contents...2 1. Introduction...3 1.1 Overview...3 1.2 PNN algorithm principles...3 1.3 Additional criteria...3
Pricing complex options using a simple Monte Carlo Simulation
A subsidiary of Sumitomo Mitsui Banking Corporation Pricing complex options using a simple Monte Carlo Simulation Peter Fink Among the different numerical procedures for valuing options, the Monte Carlo
Practical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
Scheduling Single Machine Scheduling. Tim Nieberg
Scheduling Single Machine Scheduling Tim Nieberg Single machine models Observation: for non-preemptive problems and regular objectives, a sequence in which the jobs are processed is sufficient to describe
Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS
Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and
Computing Load Aware and Long-View Load Balancing for Cluster Storage Systems
215 IEEE International Conference on Big Data (Big Data) Computing Load Aware and Long-View Load Balancing for Cluster Storage Systems Guoxin Liu and Haiying Shen and Haoyu Wang Department of Electrical
Generating Random Numbers Variance Reduction Quasi-Monte Carlo. Simulation Methods. Leonid Kogan. MIT, Sloan. 15.450, Fall 2010
Simulation Methods Leonid Kogan MIT, Sloan 15.450, Fall 2010 c Leonid Kogan ( MIT, Sloan ) Simulation Methods 15.450, Fall 2010 1 / 35 Outline 1 Generating Random Numbers 2 Variance Reduction 3 Quasi-Monte
Optimization: Continuous Portfolio Allocation
Optimization: Continuous Portfolio Allocation Short Examples Series using Risk Simulator For more information please visit: www.realoptionsvaluation.com or contact us at: [email protected]
