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

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

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

Verification and Validation. CS1538: Introduction to Simulations

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

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

Queuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall

EE 368. Weeks 3 (Notes)

Section 1.2: A Single Server Queue

Queuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models.

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

Construction Operation Simulation

Generation of Discrete Random variables

Section 9.1 (Part 2) (pp ) Type I and Type II Errors

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

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

ISE/OR 762 Stochastic Simulation Techniques

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

Queuing Theory. 3. Birth-Death Process. Law of Motion Flow balance equations Steady-state probabilities: , if

PBW 654 Applied Statistics - I Urban Operations Research

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

4.7 Finite Population Source Model

Overall Plan of Simulation and Modeling I. Chapters

280 CHAPTER 9 TESTS OF HYPOTHESES FOR A SINGLE SAMPLE Tests of Statistical Hypotheses

More on Input Distributions

Simulation. Where real stuff starts

MULTIPLE CHOICE QUESTIONS DECISION SCIENCE

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

YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS MATH , YEAR APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS)

Business Statistics 41000: Homework # 5

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

Chapter 2 SIMULATION BASICS. 1. Chapter Overview. 2. Introduction

The Queue Inference Engine and the Psychology of Queueing. ESD.86 Spring 2007 Richard C. Larson

Slides 9: Queuing Models

Variance reduction techniques

Section 3.3: Discrete-Event Simulation Examples

Richard C. Larson. March 5, Photo courtesy of Johnathan Boeke.

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

Simulation. Where real stuff starts

Chapter 11 Estimation of Absolute Performance

Review of Queuing Models

Introduction to Queueing Theory with Applications to Air Transportation Systems

Networking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013

λ λ λ In-class problems

CPU Scheduling. CPU Scheduler

Session-Based Queueing Systems

Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement

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 "

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

Simulation & Modeling Event-Oriented Simulations

IE Advanced Simulation Experiment Design and Analysis. Hong Wan Purdue University

Cover Page. The handle holds various files of this Leiden University dissertation

Output Analysis for a Single Model

Basic Statistics. 1. Gross error analyst makes a gross mistake (misread balance or entered wrong value into calculation).

ME3620. Theory of Engineering Experimentation. Spring Chapter IV. Decision Making for a Single Sample. Chapter IV

Chapter 8 Queuing Theory Roanna Gee. W = average number of time a customer spends in the system.

Chap 4. Software Reliability

7 Variance Reduction Techniques

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

Introduction to Modelling and Simulation

Chapter 5: HYPOTHESIS TESTING

Discrete probability distributions

Experiment 2 Random Error and Basic Statistics

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

Chapter 6: CPU Scheduling

The Weakest Failure Detector to Solve Mutual Exclusion

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

Fundamental Statistical Concepts and Methods Needed in a Test-and-Evaluator s Toolkit. Air Academy Associates

7. Queueing Systems. 8. Petri nets vs. State Automata

Scheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling

Discrete Event Simulation. Motive

A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL

Non Markovian Queues (contd.)

STAT FINAL EXAM

Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement

Inference with Simple Regression

Data analysis and stochastic modeling

Business Statistics: Lecture 8: Introduction to Estimation & Hypothesis Testing

Variance reduction techniques

Robust Wait Time Estimation in the US Kidney Allocation System

Morning Time: 1 hour 30 minutes

λ, µ, ρ, A n, W n, L(t), L, L Q, w, w Q etc. These

Dynamic Control of a Tandem Queueing System with Abandonments

Hypothesis Testing: One Sample


Slides 12: Output Analysis for a Single Model

IE 5112 Final Exam 2010

Introduction to Queueing Theory

CS 347 Parallel and Distributed Data Processing

ECE 3511: Communications Networks Theory and Analysis. Fall Quarter Instructor: Prof. A. Bruce McDonald. Lecture Topic

Waiting Line Models: Queuing Theory Basics. Metodos Cuantitativos M. En C. Eduardo Bustos Farias 1

Hypothesis Tests and Estimation for Population Variances. Copyright 2014 Pearson Education, Inc.

Module 5: CPU Scheduling

Scheduling I. Today Introduction to scheduling Classical algorithms. Next Time Advanced topics on scheduling

Kendall notation. PASTA theorem Basics of M/M/1 queue

Network Simulation Chapter 6: Output Data Analysis

Elementary queueing system

The Purpose of Hypothesis Testing

Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue

Queueing Theory and Simulation. Introduction

Transcription:

Simulation Discrete-Event System Simulation

Chapter 9 Verification and Validation of Simulation Models

Purpose & Overview The goal of the validation process is: To produce a model that represents true behavior closely enough for decision-making purposes To increase the model s credibility to an acceptable level Validation is an integral part of model development: Verification: building the model correctly, correctly implemented with good input and structure Validation: building the correct model, an accurate representation of the real system Most methods are informal subjective comparisons while a few are formal statistical procedures 3

Modeling-Building, Verification & Validation Steps in Model-Building Observing the real system and the interactions among their various components and of collecting data on their behavior. Construction of a conceptual model Implementation of an operational model 4

Verification Purpose: ensure the conceptual model is reflected accurately in the computerized representation. Many common-sense suggestions, for example: Have someone else check the model. Make a flow diagram that includes each logically possible action a system can take when an event occurs. Closely examine the model output for reasonableness under a variety of input parameter settings. Print the input parameters at the end of the simulation, make sure they have not been changed inadvertently. Make the operational model as self-documenting as possible. If the operational model is animated, verify that what is seen in the animation imitates the actual system. Use the debugger. If possible use a graphical representation of the model. 5

Examination of Model Output for Reasonableness Two statistics that give a quick indication of model reasonableness are current contents and total counts Current content: The number of items in each component of the system at a given time. Total counts: Total number of items that have entered each component of the system by a given time. Compute certain long-run measures of performance, e.g. compute the long-run server utilization and compare to simulation results. 6

Examination of Model Output for Reasonableness A model of a complex network of queues consisting of many service centers. If the current content grows in a more or less linear fashion as the simulation run time increases, it is likely that a queue is unstable If the total count for some subsystem is zero, indicates no items entered that subsystem, a highly suspect occurrence If the total and current count are equal to one, can indicate that an entity has captured a resource but never freed that resource. 7

Other Important Tools Documentation A means of clarifying the logic of a model and verifying its completeness. Comment the operational model, definition of all variables and parameters. Use of a trace A detailed printout of the state of the simulation model over time. - Can be very labor intensive if the programming language does not support statistic collection. - Labor can be reduced by a centralized tracing mechanism - In object-oriented simulation framework, trace support can be integrated into class hierarchy. New classes need only to add little for the trace support. 8

Trace - Example Simple queue from Chapter 2 Trace over a time interval [0, 16] Allows the test of the results by pen-and-paper method Definition of Variables: CLOCK = Simulation clock EVTYP = Event type (Start, Arrival, Departure, Stop) NCUST = Number of customers in system at time CLOCK STATUS = Status of server (1=busy, 0=idle) State of System Just After the Named Event Occurs: CLOCK = 0 EVTYP = Start NCUST=0 STATUS = 0 CLOCK = 3 EVTYP = Arrival NCUST=1 STATUS = 0 CLOCK = 5 EVTYP = Depart NCUST=0 STATUS = 0 CLOCK = 11 EVTYP = Arrival NCUST=1 STATUS = 0 CLOCK = 12 EVTYP = Arrival NCUST=2 STATUS = 1 CLOCK = 16 EVTYP = Depart NCUST=1 STATUS = 1... There is a customer, but the status is 0 9

Calibration and Validation Validation: the overall process of comparing the model and its behavior to the real system. Calibration: the iterative process of comparing the model to the real system and making adjustments. Comparison of the model to real system Subjective tests - People who are knowledgeable about the system Objective tests - Requires data on the real system s behavior and the output of the model 10

Calibration and Validation Danger during the calibration phase Typically few data sets are available, in the worst case only one, and the model is only validated for these. Solution: If possible collect new data sets No model is ever a perfect representation of the system The modeler must weigh the possible, but not guaranteed, increase in model accuracy versus the cost of increased validation effort. Three-step approach for validation: 1. Build a model that has high face validity. 2. Validate model assumptions. 3. Compare the model input-output transformations with the real system s data. 11

High Face Validity Ensure a high degree of realism: Potential users should be involved in model construction from its conceptualization to its implementation. Sensitivity analysis can also be used to check a model s face validity. Example: In most queueing systems, if the arrival rate of customers were to increase, it would be expected that server utilization, queue length and delays would tend to increase. For large-scale simulation models, there are many input variables and thus possibly many sensitity tests. - Sometimes not possible to perform all of theses tests, select the most critical ones. 12

Validate Model Assumptions General classes of model assumptions: Structural assumptions: how the system operates. Data assumptions: reliability of data and its statistical analysis. Bank example: customer queueing and service facility in a bank. Structural assumptions - Customer waiting in one line versus many lines - Customers are served according FCFS versus priority Data assumptions, e.g., interarrival time of customers, service times for commercial accounts. - Verify data reliability with bank managers - Test correlation and goodness of fit for data 13

Validate Input-Output Transformation Goal: Validate the model s ability to predict future behavior The only objective test of the model. The structure of the model should be accurate enough to make good predictions for the range of input data sets of interest. One possible approach: use historical data that have been reserved for validation purposes only. Criteria: use the main responses of interest. Input System Output Model is viewed as an input-output transformation Input Model Output 14

Bank Example Example: One drive-in window serviced by one teller, only one or two transactions are allowed. Data collection: 90 customers during 11 am to 1 pm. - Observed service times {S i, i = 1,2,, 90}. - Observed interarrival times {A i, i = 1,2,, 90}. Data analysis let to the conclusion that: - Interarrival times: exponentially distributed with rate λ =45 - Service times: N(1.1, 0.2 2 ) Input variables 15

Bank Example The Black Box A model was developed in close consultation with bank management and employees Model assumptions were validated Resulting model is now viewed as a black box : Model Output Variables, Y Uncontrolled variables, X Controlled Decision variables, D Input Variables Possion arrivals λ = 45/hr: X 11, X 12, Services times, N(D 2, 0.22): X 21, X 22, D 1 = 1 (one teller) D 2 = 1.1 min (mean service time) D 3 = 1 (one line) Model black box f(x,d) = Y Primary interest: Y 1 = teller s utilization Y 2 = average delay Y 3 = maximum line length Secondary interest: Y 4 = observed arrival rate Y 5 = average service time Y 6 = sample std. dev. of service times Y 7 = average length of time 16

Comparison with Real System Data Real system data are necessary for validation. System responses should have been collected during the same time period (from 11am to 1pm on the same day.) Compare the average delay from the model Y 2 with the actual delay Z 2 : Average delay observed, Z 2 = 4.3 minutes, consider this to be the true mean value μ 0 = 4.3. When the model is run with generated random variates X 1n and X 2n, Y 2 should be close to Z 2. 17

Comparison with Real System Data Six statistically independent replications of the model, each of 2-hour duration, are run. Replication 1 2 3 4 5 6 Sample mean Standard deviation Y 4 Arrivals/Hour 51 40 45.5 50.5 53 49 Y 5 Service Time [Minutes] 1.07 1.12 1.06 1.10 1.09 1.07 Y 2 Average Delay [Minutes] 2.79 1.12 2.24 3.45 3.13 2.38 2.51 0.82 18

Hypothesis Testing Compare the average delay from the model Y 2 with the actual delay Z 2 Null hypothesis testing: evaluate whether the simulation and the real system are the same (w.r.t. output measures): H : E(Y 0 H : E(Y 1 2 2 ) = 4. 3 minutes ) 4.3 minutes - If H 0 is not rejected, then, there is no reason to consider the model invalid - If H 0 is rejected, the current version of the model is rejected, and the modeler needs to improve the model 19

Hypothesis Testing Conduct the t test: Chose level of significance (α = 0.5) and sample size (n = 6). Compute the same mean and sample standard deviation over the n replications: Y n 1 = n 2 Y2 i = i= 1 2.51 minutes Compute test statistics: S = n i= 1 ( Y 2i Y n 1 2 ) 2 = 0.82 minutes Y2 μ0 2.51 4.3 t0 = = = 5.34 > tcritical = S / n 0.82 / 6 2.571 (for a 2 - sided test) Hence, reject H 0. - Conclude that the model is inadequate. Check: the assumptions justifying a t test, that the observations (Y 2i ) are normally and independently distributed. 20

Hypothesis Testing Similarly, compare the model output with the observed output for other measures: Y 4 Z 4, Y 5 Z 5, and Y 6 Z 6 21

Type II Error For validation, the power of the test is: Probability[ detecting an invalid model ] = 1 β β = P(Type II error) = P(failing to reject H 0 H 1 is true) Consider failure to reject H 0 as a strong conclusion, the modeler would want β to be small. Value of β depends on: - Sample size, n - The true difference, δ, between E(Y) and μ: δ = E(Y) μ σ In general, the best approach to control β error is: Specify the critical difference, δ. Choose a sample size, n, by making use of the operating characteristics curve (OC curve). 22

Type II Error Operating characteristics curve (OC curve). Graphs of the probability of a Type II Error β(δ) versus δ for a given sample size n For the same error probability with smaller difference the required sample size increses! 23

Type I and II Error Type I error (α): Error of rejecting a valid model. Controlled by specifying a small level of significance α. Type II error (β): Error of accepting a model as valid when it is invalid. Controlled by specifying critical difference and find the n. For a fixed sample size n, increasing α will decrease β. Statistical Terminology Type I: rejecting H 0 when H 0 is true Type II: failure to reject H 0 when H 1 is true Modeling Terminology Rejecting a valid model Failure to reject an invalid model Associated Risk α β 24

Confidence Interval Testing Confidence interval testing: evaluate whether the simulation and the real system performance measures are close enough. If Y is the simulation output, and μ = E(Y) The confidence interval (CI) for μ is: Y ± t α, n 1 2 S n 25

Confidence Interval Testing Validating the model: Suppose the CI does not contain μ 0 : - If the best-case error is > ε, model needs to be refined. - If the worst-case error is ε, accept the model. - If best-case error is ε, additional replications are necessary. Suppose the CI contains μ 0 : - If either the best-case or worst-case error is > ε, additional replications are necessary. - If the worst-case error is ε, accept the model. ε is a difference value chosen by the analyst, that is small enough to allow valid decisions to be based on simulations! 26

Confidence Interval Testing Bank example: μ 0 = 4.3, and close enough is ε = 1 minute of expected customer delay. A 95% confidence interval, based on the 6 replications is [1.65, 3.37] because: S Y ± t0.025,5 n 0.82 2.51± 2.571 6 μ 0 = 4.3 falls outside the confidence interval, - the best case 3.37 4.3 = 0.93 < 1, but - the worst case 1.65 4.3 = 2.65 > 1 Additional replications are needed to reach a decision. 27

Using Historical Output Data An alternative to generating input data: Use the actual historical record. Drive the simulation model with the historical record and then compare model output to system data. In the bank example, use the recorded interarrival and service times for the customers {A n, S n, n = 1,2, }. Procedure and validation process: similar to the approach used for system generated input data. 28

Using a Turing Test Use in addition to statistical test, or when no statistical test is readily applicable. Turing Test Described by Alan Turing in 1950. A human jugde is involved in a natural language conversation with a human and a machine. If the judge cannot reliably tell which of the partners is the machine, then the machine has passed the test. Utilize persons knowledge about the system. For example: Present 10 system performance reports to a manager of the system. Five of them are from the real system and the rest are fake reports based on simulation output data. If the person identifies a substantial number of the fake reports, interview the person to get information for model improvement. If the person cannot distinguish between fake and real reports with consistency, conclude that the test gives no evidence of model inadequacy. 29

Summary Model validation is essential: Model verification Calibration and validation Conceptual validation Best to compare system data to model data, and make comparison using a wide variety of techniques. Some techniques that we covered: Insure high face validity by consulting knowledgeable persons. Conduct simple statistical tests on assumed distributional forms. Conduct a Turing test. Compare model output to system output by statistical tests. 30