Chapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Similar documents
Chapter 11 Estimation of Absolute Performance

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.

Slides 12: Output Analysis for a Single Model

Chapter 11. Output Analysis for a Single Model Prof. Dr. Mesut Güneş Ch. 11 Output Analysis for a Single Model

Output Analysis for a Single Model

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

EE/PEP 345. Modeling and Simulation. Spring Class 11

Construction Operation Simulation

Output Data Analysis for a Single System

B. Maddah INDE 504 Discrete-Event Simulation. Output Analysis (1)

Overall Plan of Simulation and Modeling I. Chapters

Redacted for Privacy

Chapter 10 Verification and Validation of Simulation Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Chapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Discrete-Event System Simulation

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.

Simulation. Where real stuff starts

Chapter 10 Verification and Validation of Simulation Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Network Simulation Chapter 6: Output Data Analysis

IE 581 Introduction to Stochastic Simulation. Three pages of hand-written notes, front and back. Closed book. 120 minutes.

Simulation. Where real stuff starts

Review of Queuing Models

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.

A A Multi-Echelon Inventory Model for a Reparable Item with one-for. for- one Replenishment

SEQUENTIAL ESTIMATION OF THE STEADY-STATE VARIANCE IN DISCRETE EVENT SIMULATION

THIELE CENTRE. The M/M/1 queue with inventory, lost sale and general lead times. Mohammad Saffari, Søren Asmussen and Rasoul Haji

Output Data Analysis for a Single System

Queueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1

Simulation of stationary processes. Timo Tiihonen

7 Variance Reduction Techniques

Name of the Student:

Contents LIST OF TABLES... LIST OF FIGURES... xvii. LIST OF LISTINGS... xxi PREFACE. ...xxiii

Queueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements

Lecture 20. Poisson Processes. Text: A Course in Probability by Weiss STAT 225 Introduction to Probability Models March 26, 2014

Analysis of Simulated Data

Slides 9: Queuing Models

2WB05 Simulation Lecture 7: Output analysis

PBW 654 Applied Statistics - I Urban Operations Research

ESTIMATION AND OUTPUT ANALYSIS (L&K Chapters 9, 10) Review performance measures (means, probabilities and quantiles).

Simulation model input analysis

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

Variance reduction techniques

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

Root-Unroot Methods for Nonparametric Density Estimation and Poisson Random-Effects Models

L = λ W time average number in Line or system arrival rate W average Waiting time per customer

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

Homework 4 Math 11, UCSD, Winter 2018 Due on Tuesday, 13th February

M.Sc. (Final) DEGREE EXAMINATION, MAY Final Year. Statistics. Paper I STATISTICAL QUALITY CONTROL. Answer any FIVE questions.

Wooldridge, Introductory Econometrics, 4th ed. Appendix C: Fundamentals of mathematical statistics

Systems Simulation Chapter 6: Queuing Models

Non-Persistent Retrial Queueing System with Two Types of Heterogeneous Service

Introduction to Queueing Theory with Applications to Air Transportation Systems

Outline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue.

QUEUING SYSTEM. Yetunde Folajimi, PhD

12.10 (STUDENT CD-ROM TOPIC) CHI-SQUARE GOODNESS- OF-FIT TESTS

ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS

ISyE 6644 Fall 2014 Test 3 Solutions

1.225J J (ESD 205) Transportation Flow Systems

Variance reduction techniques

Inference for the Regression Coefficient

1. How can you tell if there is serial correlation? 2. AR to model serial correlation. 3. Ignoring serial correlation. 4. GLS. 5. Projects.

Practice Problems Section Problems

Formal Statement of Simple Linear Regression Model

Solutions to COMP9334 Week 8 Sample Problems

Economics 2010c: Lectures 9-10 Bellman Equation in Continuous Time

Non Markovian Queues (contd.)

Monday, November 26: Explanatory Variable Explanatory Premise, Bias, and Large Sample Properties

Initial Transient Phase of Steady state Simulation: Methods of Its Length Detection and Their Evaluation in Akaroa2

Module 1: Introduction to Experimental Techniques Lecture 5: Design of experiments. The Lecture Contains: Design of Experiments. Objectives_template

Queueing Theory (Part 4)

Solutions to Homework Discrete Stochastic Processes MIT, Spring 2011

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.

Link Models for Circuit Switching

λ λ λ In-class problems

Review for Midterm 2

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR

Answers to selected exercises

OUTLINE. Deterministic and Stochastic With spreadsheet program : Integrated Mathematics 2

Random Walk on a Graph

ISyE 2030 Practice Test 2

ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS

Discrete Event and Process Oriented Simulation (2)

Transient Solution of a Multi-Server Queue. with Catastrophes and Impatient Customers. when System is Down

Queueing Theory. VK Room: M Last updated: October 17, 2013.

IE 5112 Final Exam 2010

Waiting Time Analysis of A Single Server Queue in an Out- Patient Clinic

Bulk input queue M [X] /M/1 Bulk service queue M/M [Y] /1 Erlangian queue M/E k /1

Stochastic (Random) Demand Inventory Models

Computer Systems Modelling

Readings: Finish Section 5.2

14 Random Variables and Simulation

Basic Queueing Theory

Markov Processes and Queues

Statistics 433 Practice Final Exam: Cover Sheet and Marking Sheet

On Successive Lumping of Large Scale Systems

ST 371 (IX): Theories of Sampling Distributions

Session-Based Queueing Systems

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

Data analysis and stochastic modeling

57:022 Principles of Design II Final Exam Solutions - Spring 1997

Transcription:

Chapter 11 Output Analysis for a Single Model Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Purpose Objective: Estimate system performance via simulation If q is the system performance, the precision of the estimator can be measured by: qˆ The standard error of qˆ. The width of a confidence interval (CI) for q. Purpose of statistical analysis: To estimate the standard error or CI. To figure out the number of observations required to achieve desired error/ci. Potential issues to overcome: Autocorrelation, e.g. inventory cost for subsequent weeks lack statistical independence. Initial conditions, e.g. inventory on hand and # of backorders at time 0 would most likely influence the performance of week 1. 2

Outline Distinguish the two types of simulation: transient vs. steady state. Illustrate the inherent variability in a stochastic discreteevent simulation. Cover the statistical estimation of performance measures. Discusses the analysis of transient simulations. Discusses the analysis of steady-state simulations. 3

Type of Simulations Terminating versus non-terminating simulations Terminating simulation: Runs for some duration of time T E, where E is a specified event that stops the simulation. Starts at time 0 under well-specified initial conditions. Ends at the stopping time T E. Bank example: Opens at 8:30 am (time 0) with no customers present and 8 of the 11 teller working (initial conditions), and closes at 4:30 pm (Time T E = 480 minutes). The simulation analyst chooses to consider it a terminating system because the object of interest is one day s operation. 4

Type of Simulations Non-terminating simulation: Runs continuously, or at least over a very long period of time. Examples: assembly lines that shut down infrequently, telephone systems, hospital emergency rooms. Initial conditions defined by the analyst. Runs for some analyst-specified period of time T E. Study the steady-state (long-run) properties of the system, properties that are not influenced by the initial conditions of the model. Whether a simulation is considered to be terminating or non-terminating depends on both The objectives of the simulation study and The nature of the system. 5

Stochastic Nature of Output Data Model output consist of one or more random variables (r. v.) because the model is an input-output transformation and the input variables are r.v. s. M/G/1 queueing example: Poisson arrival rate = 0.1 per minute; service time ~ N(m = 9.5, s =1.75). System performance: long-run mean queue length, L Q. Suppose we run a single simulation for a total of 5,000 minutes Divide the time interval [0, 5000) into 5 equal subintervals of 1000 minutes. Average number of customers in queue from time (j-1)1000 to j(1000) is Y j. 6

Stochastic Nature of Output Data M/G/1 queueing example (cont.): Batched average queue length for 3 independent replications: Batching Interval Replication (minutes) Batch, j 1, Y 1j 2, Y 2j 3, Y 3j [0, 1000) 1 3.61 2.91 7.67 [1000, 2000) 2 3.21 9.00 19.53 [2000, 3000) 3 2.18 16.15 20.36 [3000, 4000) 4 6.92 24.53 8.11 [4000, 5000) 5 2.82 25.19 12.62 [0, 5000) 3.75 15.56 13.66 Inherent variability in stochastic simulation both within a single replication and across different replications. The average across 3 replications, Y1, Y2., Y, can be regarded as. 3. independent observations, but averages within a replication, Y 11,, Y 15, are not. 7

Measures of performance Consider the estimation of a performance parameter, q (or f), of a simulated system. Discrete time data: [Y 1, Y 2,, Y n ], with ordinary mean: q Continuous-time data: {Y(t), 0 t T E } with time-weighted mean: f Point estimation for discrete time data. The point estimator: qˆ 1 n n i 1 Y i Is unbiased if its expected value is q, that is if: Is biased if: E( ˆ) q q E( ˆ) q q Desired 8

Point Estimator [Performance Measures] Point estimation for continuous-time data. The point estimator: Is biased in general where: E( ˆ) f f. fˆ An unbiased or low-bias estimator is desired. 1 T E Y( t) dt T 0 E Usually, system performance measures can be put into the common framework of q or f: e.g., the proportion of days on which sales are lost through an outof-stock situation, let: 1, if out of stock on day i Yi 0, otherwise 9

Confidence-Interval Estimation [Performance Measures] To understand confidence intervals fully, it is important to distinguish between measures of error, and measures of risk, e.g., confidence interval versus prediction interval. Suppose the model is the normal distribution with mean q, variance s 2 (both unknown). Let Y i be the average cycle time for parts produced on the i th replication of the simulation (its mathematical expectation is q). Average cycle time will vary from day to day, but over the long-run the average of the averages will be close to q. R 2 1 2 Sample variance across R replications: S ( Y i. Y.. ) R 1 i1 10

Confidence-Interval Estimation [Performance Measures] Confidence Interval (CI): A measure of error. Where Y i. are normally distributed. Y.. t / 2, R1 We cannot know for certain how far bound that error. is from q but CI attempts to A CI, such as 95%, tells us how much we can trust the interval to actually bound the error between and q. The more replications we make, the less error there is in (converging to 0 as R goes to infinity). S R Y.. Y.. Y.. 11

Confidence-Interval Estimation [Performance Measures] Prediction Interval (PI): A measure of risk. A good guess for the average cycle time on a particular day is our estimator but it is unlikely to be exactly right. PI is designed to be wide enough to contain the actual average cycle time on any particular day with high probability. Normal-theory prediction interval: Y.. t / 2, R1S 1 1 R The length of PI will not go to 0 as R increases because we can never simulate away risk. PI s limit is: q z / 2s 12

Output Analysis for Terminating Simulations A terminating simulation: runs over a simulated time interval [0, T E ]. A common goal is to estimate: 1 q E n 1 f E TE n i1 0 Y T E i, Y ( t) dt, for discrete output for continuous output Y ( t),0 t T In general, independent replications are used, each run using a different random number stream and independently chosen initial conditions. E 13