Overall Plan of Simulation and Modeling I. Chapters

Size: px
Start display at page:

Download "Overall Plan of Simulation and Modeling I. Chapters"

Transcription

1 Overall Plan of Simulation and Modeling I Chapters Introduction to Simulation Discrete Simulation Analytical Modeling Modeling Paradigms Input Modeling Random Number Generation Output Analysis Continuous and Hybrid Simulation Simulation Software Simulation and Modeling I Output Data Analysis 1

2 Output Data Analysis Contents Statistic Nature of Simulation Output Parameter Estimation in Statistics Confidence Intervals in Statistics Transient and Steady-State Behavior Statistical Analysis of Terminating Simulations Statistical Analysis of Steady-State Simulations Simulation Control in AnyLogic Simulation and Modeling I Output Data Analysis

3 Statistic Nature of Simulation Output Statistical analysis of simulation output data simulation runs don t give exact answers observations from a stochastic process different runs of same model different numerical results let X 1, X,... be an output from a single simulation run X i s are generally correlated let x 1 (1), x (1),, x m (1) be a realization from one run repeat n runs with independent random numbers leads to n independent replications: x (1) 1, x (1),, x (1) m x () 1, x (),, x () m... x (n) 1, x (n),, x (n) m for each replication we expect different outcomes Simulation and Modeling I Output Data Analysis 3

4 Statistic Nature of Simulation Output (cont.) Example: Bank 5 tellers, 1 FIFO queue, doors open 9 a.m. - 5 p.m., open until empty exponentially distributed interarrivals (mean = 1 min.) exponentially distributed service times (mean = 4 min.) 10 replications (of one day), initially empty Replication Results for 10 independent replications of the bank model Number served Finish time (hours) Average delay in queue (minutes) Average queue length Proportion of customers delayed <minutes Simulation and Modeling I Output Data Analysis 4

5 Output Data Analysis Contents Statistic Nature of Simulation Output Parameter Estimation in Statistics Confidence Intervals in Statistics Transient and Steady-State Behavior Statistical Analysis of Terminating Simulations Statistical Analysis of Steady-State Simulations Simulation Control in AnyLogic Simulation and Modeling I Output Data Analysis 5

6 Parameter Estimation in Statistics Random sampling in statistical inference (recapitulation) random sample X 1, X,..., X n of size n from the population, provided they are mutually independent and identically distributed with F(x) statistic f(x 1, X,..., X n ) is also a RV with so-called sampling distribution estimator: a statistic used to estimate the value of a parameter estimation is based on n experimental outcomes x 1, x,..., x n each experimental outcome x i is a value of the RV X i sample mean: estimator of µ µ ˆ = X(n) sample variance: estimator of σ = n i= 1 n X i σˆ = S (n) = n ( Xi X(n) ) i= 1 n 1 Simulation and Modeling I Output Data Analysis 6

7 Parameter Estimation in Statistics (cont.) Overview of the various quantities population distribution F(x), its mean µ and variance σ assume IID samples X 1, X,..., X n sample mean µ ˆ = X(n) and sample variance σˆ = S (n) the sample distributions of the sample mean and sample variance sample-mean variance Var [ X( n) ] the estimator of the sample-mean variance σ = n Vˆ ar [ X( n) ] S = ( n) n Simulation and Modeling I Output Data Analysis 7

8 Parameter Estimation in Statistics (cont.) Dependent samples simulation output data are almost always correlated the sample RVs X 1, X,..., X n are thus not independent the sample mean is still consistent and unbiased but the estimator for the sample-mean variance is wrong and its naïve application would lead to gross underestimations example: M/M/1 queue with utilization = 0.9 consider first ten delays D 1, D,..., D 10 it can be shown analytically that Var[D( two possibilities 10) ] [ 10)/10] E S( = correct the formula by using correlations (possible but complicated) use independent replications (our choice) (the sample-mean variance is much bigger than derived by the estimator for independent samples) Simulation and Modeling I Output Data Analysis 8

9 Parameter Estimation in Statistics (cont.) Independent replications we replicate the experiment n times, each experiment with m observations if initial state of each replication is randomly chosen, the results of the n replications will be independent the variance of the sample mean is then available by using the arguments from random sampling this approach is commonly applied in simulation output data analysis Simulation and Modeling I Output Data Analysis 9

10 Parameter Estimation in Statistics (cont.) Independent replications (cont.) x i (j) is the ith observation in the jth replication, the RV is X i (j) the sample mean of the jth replication is X ( j ) ( m) m ( j) the overall sample mean is ( ) X n = the overall sample variance is S ( n) = n j= 1 = m i= 1 X X i ( j ) ( j) ( m) Xi n = n m j= 1 i= 1 nm n ( j [ X ) ( m) X( n) ] j= 1 n 1 and the estimated variance of the overall sample mean is: S Vˆ ar[x n ] = ( ) ( n) n Simulation and Modeling I Output Data Analysis 10

11 Output Data Analysis Contents Statistic Nature of Simulation Output Parameter Estimation in Statistics Confidence Intervals in Statistics Transient and Steady-State Behavior Statistical Analysis of Terminating Simulations Statistical Analysis of Steady-State Simulations Simulation Control in AnyLogic Simulation and Modeling I Output Data Analysis 11

12 Confidence Intervals in Statistics So far: point estimation only rarely the true value and the estimation will be identical in non-random situations, quality of an estimate µˆ of a true value µ is often assessed via a bounded relative error: µ µ γ µ with random sampling, we may only hope to bound the relative error X(n) µ probabilistically: P γ = 1 α µ where 1-α is a large probability, say, 0.9,0.95,0.99, etc. As shown on the next slides, an interval estimate of the form P(X(n) δ µ X(n) + δ) = 1 α allows us to bound the relative error probabilistically known as confidence intervals Simulation and Modeling I Output Data Analysis 1

13 Confidence Intervals in Statistics (cont.) Definitions of 100(1-α)% confidence intervals confidence interval [ X(n) δ, X(n) + δ] δ is the confidence half-length 1-α is the confidence level, so that P(X(n) δ µ X(n) + δ) = 1 α typical values: α = 0.1, 0.05, 0.01 fraction ε = δ / X(n) is the relative confidence half-length Simulation and Modeling I Output Data Analysis 13

14 Confidence Intervals in Statistics (cont.) Interpretation of confidence intervals confidence intervals are constructed for estimating a mean µ right: 100(1-α)% of the time, the interval formed this way covers µ µ (unknown) wrong: take one of the constructed confidence intervals and say that µ lies in this interval with probability 1-α in practice the second interpretation is common (and is also often stated incorrectly in textbooks) Simulation and Modeling I Output Data Analysis 14

15 Confidence Intervals in Statistics (cont.) Central Limit Theorem most important result in probability theory definitions let X 1, X,..., X n be IID RVs with finite mean µ and finite variance σ (but no further assumption on distribution) X(n) µ define statistic Zn = σ / n note: µ and σ /n are the mean and variance of statement: for large n, the distribution of Z n converges to a standard normal distribution (for any population distribution) interpretation: if n is sufficiently large, Z n is approximately distributed as a standard normal variable ( ) also: X n N(µ, σ /n) X( n) Simulation and Modeling I Output Data Analysis 15

16 Confidence Intervals in Statistics (cont.) Sampling from the normal distribution in practice: variance σ is unknown but sample variance S (n) converges to σ as n gets large central limit theorem still holds if σ is replaced by S (n) ( ) X n μ S ( n)/n is still approximately N(0,1)-distributed for large n let z 1-α/ be the (1-α/)-quantile of the standard normal distribution for large n we get z X(n) µ α / z α 1 α 1 / S (n) / n P 1 and an approximate 100(1-α)% confidence interval [X(n) z 1 α / S (n) / n, X(n) + z1 α / S (n) / n] Simulation and Modeling I Output Data Analysis 16

17 Confidence Intervals in Statistics (cont.) Sampling from the normal distribution (cont.) true value µ is covered with probability 1-α: f(x) Shaded area = 1 - α -z 1-α/ 0 z 1-α/ x practical problem: when is n sufficiently large? Simulation and Modeling I Output Data Analysis 17

18 Confidence Intervals in Statistics (cont.) Sampling from the normal distribution (cont.) quantiles of the standard normal distribution: α α/ quantile z 1-α/ more values in most statistical textbooks, e.g., Table T.1 in Law/Kelton take care whether α or 1-α/ is used in the table! Simulation and Modeling I Output Data Analysis 18

19 Confidence Intervals in Statistics (cont.) Sampling from the normal distribution (cont.) example 10 independent observations: 1.0, 1.50, 1.68, 1.89, 0.95, 1.49, 1.58, 1.55, 0.50, 1.09 X(10) = 1.34 and S (10) = 0.17 z 0.95 = (from table) approximate 90% confidence interval: [ S = [ , ] = [1.13,1.55] ( 10) /10, S ( 10) /10] Simulation and Modeling I Output Data Analysis 19

20 Confidence Intervals in Statistics (cont.) Sampling from the Student-t distribution when the sample size n is small (n < 30), the approximation of the normal distribution is poor alternatively, the Student-t distribution can be used this approach is commonly applied in simulation output data analysis, together with independent replications as assumption we need that the X i s are normally distributed define statistic t n 1 = X(n) µ S (n) / n t n-1 has a Student-t distribution with n-1 degrees of freedom (df) t n-1,1-α/ is its (1-α/)-quantile an exact 100(1-a)% confidence interval is [X(n) t n 1,1 α / S (n) / n, X(n) + t n 1,1 α / S (n) / n] see complementary problem of testing the hypothesis H 0 : µ = µ 0 (slide 11 of Statistics and Tests ) Simulation and Modeling I Output Data Analysis 0

21 Confidence Intervals in Statistics (cont.) Sampling from the Student-t distribution (cont.) density functions of the standard normal distribution and the Student-t distribution with 4 df (=m) f m (x) = Γ F(x) =... ( ( m + 1) ) x mπ Γ( m ) m ( involves Gamma and Beta function) m + 1 f(x) Standard normal distribution Student-t distribution with 4 df E[X] = 0 Var[X] = m m 0 t n-1, 1-α/ > z 1-α/ (i.e., larger confidence interval for Student-t case and coverage closer to desired level α) and t n-1, 1-α/ z 1-α/ for large n for n 30, quantiles from the standard normal distribution can be used Simulation and Modeling I Output Data Analysis 1 x

22 Confidence Intervals in Statistics (cont.) Sampling from the Student-t distribution (cont.) quantiles of the Student-t distribution: α α/ quantile t 4, 1-α/ quantile t 9, 1-α/ quantile t 19, 1-α/ quantile t 9, 1-α/ quantile t 50, 1-α/ quantile t 100, 1-α/ quantile z 1-α/ more values in Table T.1 in Law/Kelton Simulation and Modeling I Output Data Analysis

23 Confidence Intervals in Statistics (cont.) Sampling from the Student-t distribution (cont.) previous example of 10 observations X(10) = 1.34 and S (10) = 0.17 t 9, 0.95 = (from table) 90% confidence interval (slightly larger now): [ S (10)/10, (10)/10] = [ , ] = [1.1,1.58] approximation the confidence interval is still an approximation, if the population distribution is not normal we cannot assume that simulation output data are normally distributed question: how good is the coverage of this Student t confidence interval for other population distributions? S Simulation and Modeling I Output Data Analysis 3

24 Confidence Intervals in Statistics (cont.) Coverage estimation sampling from distributions with known parameters normal exponential chi-square with 1 df, lognormal hyperexponential with F(x) = 0.9(1-e -0.5x ) + 0.1(1-e -5.5x ) 90% confidence intervals were constructed for estimating the mean with sample sizes n = 5, 10, 0, 40 repeated in 500 independent experiments since the true parameters are known, empirical coverages can be determined from these experiments Simulation and Modeling I Output Data Analysis 4

25 Confidence Intervals in Statistics (cont.) Coverage estimation (cont.) empirical coverages: distribution skewness n=5 n=10 n=0 n=40 normal exponential chi square lognormal hyperexponential coverage gets close to 90% as n gets larger the larger the skewness, the larger the needed sample size Simulation and Modeling I Output Data Analysis 5

26 Confidence Intervals in Statistics (cont.) Summary: Student-t confidence intervals goal: point estimate and confidence interval for mean µ = E(X) make n independent replications with X 1, X,... X n (used to be for j=1,,n) ( X j) ( m) sample mean sample variance X(n) n X i i= 1 confidence interval half-length S = 1 n 1 (n) = n 1 n i= 1 δ (X = i t X(n)) n 1,1 α / S (n) n confidence interval [ X(n) δ, X(n) + δ] Simulation and Modeling I Output Data Analysis 6

27 Confidence Intervals in Statistics (cont.) Obtaining a specified precision δ and thus confidence interval is known, i.e., we have P(X(n) δ µ X(n) + δ) 1 α but actually we want to bound the relative error (X n) µ µ γ we need to find a confidence interval half-length such that a requested relative error is met Simulation and Modeling I Output Data Analysis 7

28 Confidence Intervals in Statistics (cont.) Obtaining a specified precision (cont.) relative half-length: ε = δ / X(n) we can derive the relationship: 1 α P(X(n) δ µ X(n) + δ) = P( X(n) µ δ ) = P( X(n) µ ε X(n) ) = P( X(n) µ ε X(n) µ + µ ) triangle inequality P( X(n) µ ε X(n) µ + ε µ ) = P((1 ε) X(n) µ ε µ ) = P( X(n) µ / µ ε /(1 ε)) relative error is hence bounded by ε/(1-ε) with probability 1-α therefore choose δ such that ε/(1-ε) < γ with ε = δ / X(n) and for given γ Simulation and Modeling I Output Data Analysis 8

29 Confidence Intervals in Statistics (cont.) Obtaining a specified precision (cont.) previous example of 10 observations X(10) = 1.34 and S (10) = 0.17 confidence half-length δ = 0.4 relative confidence half-length = 0.4/ relative error bound = ε/(1-ε) 0.18 useful procedure for specific confidence level 1-α: specify relative error γ (e.g., 0.1, 0.05) increase n (which will decrease δ and thus ε) until relative error bound ε/(1-ε) is small enough, i.e., less than γ leads to: ε = δ X < γ + ( n) 1 γ Simulation and Modeling I Output Data Analysis 9

30 Output Data Analysis Contents Statistic Nature of Simulation Output Parameter Estimation in Statistics Confidence Intervals in Statistics Transient and Steady-State Behavior Statistical Analysis of Terminating Simulations Statistical Analysis of Steady-State Simulations Simulation Control in AnyLogic Simulation and Modeling I Output Data Analysis 30

31 Transient and Steady-State Behavior Convergence to steady-state output process: Y 1, Y,... consider the transient distribution F i (y initial condition) = P(Y i y initial condition) corresponding density functions f i : Simulation and Modeling I Output Data Analysis 31

32 Transient and Steady-State Behavior (cont.) Example: M/M/1 queue consider delays D 1, D,... transient means: E(D i ) arrival rate = 1 utilization = 0.9 s = number in system at time 0 Simulation and Modeling I Output Data Analysis 3

33 Transient and Steady-State Behavior (cont.) Types of simulations terminating simulations specific initial and stopping conditions bank example: simulate from 9 a.m. (initially with no customers) until at least 5 p.m. and all customers have left measures depend on initial and stopping conditions similar to transient analysis (but not equivalent) steady-state simulations (nonterminating simulations) no natural event to specify simulation length interest in long-run system behavior when operating normally corresponds to steady-state analysis Simulation and Modeling I Output Data Analysis 33

34 Transient and Steady-State Behavior (cont.) When terminating and when steady-state simulations? a modeling decision example: military confrontation, goal is to find out winner terminating simulation until one force has lost 30 % example: aerospace manufacturer must produce 100 airplanes within 18 months and want to compare various manufacturing configurations to see whether deadline can be met terminating simulation until 100 airplanes have been completed example: a manufacturer operating 16 hours a day (two shifts) with work carrying over from one day to the next and wants to know the throughput of parts steady-state simulation (continuous process, ending conditions from one day are initial conditions of next) example: a Web content provider wants to know the impact on download times of adding new hardware to its Web server steady-state simulation Simulation and Modeling I Output Data Analysis 34

35 Output Data Analysis Contents Statistic Nature of Simulation Output Parameter Estimation in Statistics Confidence Intervals in Statistics Transient and Steady-State Behavior Statistical Analysis of Terminating Simulations Statistical Analysis of Steady-State Simulations Simulation Control in AnyLogic Simulation and Modeling I Output Data Analysis 35

36 Statistical Analysis of Terminating Simulations Approach: make n independent replications same initial conditions for each replication same stopping conditions for each replication separate random numbers for each replication let X j be summary measure of jth replication (used to be X 1, X,... X n are a random sample (IID) can apply simple statistics can mostly rely on normality assumption ( X j) ( m) for j=1,,n) Simulation and Modeling I Output Data Analysis 36

37 Statistical Analysis of Terminating Simulations (cont.) Estimating means (recall) goal: point estimate and confidence interval for mean µ = E(X) make n replications with X 1, X,... X n sample mean sample variance X(n) n X i i= 1 confidence interval half-length S = 1 n 1 (n) = n 1 n i= 1 (X i X(n)) δ(n, α) = t n 1,1 α / S (n) n confidence interval [ X(n) δ(n, α),x(n) + δ(n, α)] rel. interval half-length ε = δ / X(n), rel. error bound ε/(1-ε) Simulation and Modeling I Output Data Analysis 37

38 Statistical Analysis of Terminating Simulations (cont.) Example: bank n = 10 replications estimation of average delay in queue X(10) =.03, S (10) = 0.31, δ 10,0.01) = t ( 9,0. 95 = 90% confidence interval: [1.71,.35] minutes estimated proportion of customers with a delay less than 5 minutes X(10) = 0.853, S (10) = 0.004, δ 10,0.01) = t ( 9,0. 95 = 90% confidence interval: [0.817, 0.889] Simulation and Modeling I Output Data Analysis 38

39 Statistical Analysis of Terminating Simulations (cont.) Normality assumption actually: the X j s are not normally distributed but: if averaged over a large number of data in each replication, central limit theorem says that they are approximately normally distributed example: M/M/1 queue (utilization = 0.9), average of the m first delays, histograms of results for 500 replications: m = 5, large skew: m = 6400, smaller skew: h(x) h(x) x x Simulation and Modeling I Output Data Analysis 39

40 Statistical Analysis of Terminating Simulations (cont.) Coverage estimation experimental estimation of coverage for the M/M/1 queue (m = 5) with an increasing number n of replications analysis: µ = times a 90% confidence interval was constructed count % of these intervals covering µ estimate average of relative precision in all intervals n coverage average relative half-length 5 88% % % % 0.1 coverage is close, relative half length decreases with square root of n, i.e., with n Simulation and Modeling I Output Data Analysis 40

41 Statistical Analysis of Terminating Simulations (cont.) Obtaining a specified precision want: obtain a certain confidence level and relative error fixed-sample-size procedure fix number n of replications in advance hard to determine required n for given relative error bank example n = 10 replications, set α = 0.1 ε = and ε/(1-ε) = 0.187, interval: [1.71,.35] sequential procedure increase n until ε is small enough bank example set α = 0.1, relative error 10% after n = 74 replications: X(74) = 1.76, S (74) = 0.67, δ( 74,0.01) = ε = 0.09 and ε/(1-ε) = 0.10, interval: [1.60, 1.9] Simulation and Modeling I Output Data Analysis 41

42 Statistical Analysis of Terminating Simulations (cont.) Algorithm: sequential procedure input initial number of replications n 0 relative error γ level α e.g., n 0 = 10, γ = 0.1, α = 0.1 initial replications set n = n 0 make n replications compute X(n) and δ(n,α) from X 1, X,... X n while δ( n, α) / X(n) γ /(1+ γ) do make additional replication n++ compute new X(n) and δ(n,α) return [ X(n) δ(n, α),x(n) + δ(n, α)] ε from < 1- ε δ ε = X γ : ( n, α) γ < ( n) 1+ γ Simulation and Modeling I Output Data Analysis 4

43 Output Data Analysis Contents Statistic Nature of Simulation Output Parameter Estimation in Statistics Confidence Intervals in Statistics Transient and Steady-State Behavior Statistical Analysis of Terminating Simulations Statistical Analysis of Steady-State Simulations Simulation Control in AnyLogic Simulation and Modeling I Output Data Analysis 43

44 Statistical Analysis of Steady-State Simulations Characteristics of steady-state simulation aimed to give insight after a long period of time initial transient (nonstationary, warm-up) period after launching, initially in this period example: a queue started empty data from this period leads to significant bias and must be discarded convergence to steady state the observations are still fluctuating and are (typically) correlated must run simulation long enough to get specified precision Simulation and Modeling I Output Data Analysis 44

45 Statistical Analysis of Steady-State Simulations (cont.) The two main problems duration of the initial transient period need methods to estimate duration rules of thumb graphical procedures statistical tests must discard data from this period analysis of correlated data need stopping criteria to run simulation until a precision is met must deal with correlations conceptually simple: independent replications, batch means also other statistical methods: more sophisticated Simulation and Modeling I Output Data Analysis 45

46 Statistical Analysis of Steady-State Simulations (cont.) Rules of thumb for detection of the initial transient period e.g., the initial transient period is over if the first observation is neither the minimum nor the maximum of the rest the longest cycle of the simulated system has been executed three or four times the sample mean approaches a constant level with a given accuracy the variance of the sample mean is approximately inversely proportional to the number of observations the observations cross the sample mean k times (e.g., k = 5 is a common approach)... Simulation and Modeling I Output Data Analysis 46

47 Statistical Analysis of Steady-State Simulations (cont.) Schruben s test for detection of the initial transient period a test to check whether X 1, X,... X n is a stationary sequence not discussed here suggests sequential procedure: use a heuristic rule to guess length of initial transient period and discard those observations make new observations use Schruben s test to check stationarity no stationary? yes start steady-state simulation discard a number of observations from the beginning of the sequence Simulation and Modeling I Output Data Analysis 47

48 Statistical Analysis of Steady-State Simulations (cont.) Welch s graphical procedure for detection of the initial transient period step 1) make n independent replications, each of length m (n 5, m large) let Y ij be the ith observation from the jth replication step ) n 1 let Y be the averaged process i = Y ij n j= 1 the averaged process has the same mean as the original process, but only (1/n)th the variance step 3) smooth out high-frequency oscillations (but leave the long-run trend) by the moving average with window size w (w m/4): 1 w + 1 = 1 i + 1s w s= w Yi (w) i 1 Y Y i+ s i+ s = (i 1) if i = w + 1,...,m w if i = 1,..., w Simulation and Modeling I Output Data Analysis 48

49 Statistical Analysis of Steady-State Simulations (cont.) Welch s graphical procedure for detection of the initial transient period (cont.) Replication 1 Y 11, Y 1, Y 13, Y 14,..., Y 1,m-, Y 1,m-1, Y 1,m n Y 1, Y, Y 3, Y 4,..., Y,m-, Y,m-1, Y,m Y n1, Y n, Y n3, Y n4,... Y n,m-, Y n,m-1, Y n,m Step 1 Averaged process Y 1 Y Y 3 Y 4... Y m- Y m Y m-1 Step Moving averaged w = 1 Y 1 (1)Y (1)Y 3 (1)... Y m-1 (1) Step 3 Simulation and Modeling I Output Data Analysis 49

50 Statistical Analysis of Steady-State Simulations (cont.) Welch s graphical procedure for detection of the initial transient period (cont.) step 4) plot the moving average and choose ( eyeball ) l such that (w),y (w),... appear to have converged Yl + 1 l+ recommendations initially, n = 5 or 10 plot the moving average for several values of w and choose smallest value for which the plot is smooth same problem as with histograms: w too small: ragged plot w too large: overaggregated if not satisfactory, increase n by 5 or 10 Simulation and Modeling I Output Data Analysis 50

51 Statistical Analysis of Steady-State Simulations (cont.) Example small factory with machining center and inspection station Queue Machining Queue Inspection 0.9 good center station 0.1 bad unfinished parts arrive with exponentially distributed interarrival times, mean = 1 minute processing times at machine uniform on [0.65, 0.70] minutes 90% inspected parts good and sent to shipping rest bad and sent back to machine for rework consider N 1, N,..., where N i is the number of parts sent to shipping in the ith hour Simulation and Modeling I Output Data Analysis 51

52 Statistical Analysis of Steady-State Simulations (cont.) Example (cont.) averaged process over 10 replications: Simulation and Modeling I Output Data Analysis 5

53 Statistical Analysis of Steady-State Simulations (cont.) Example (cont.) moving averages for w = 0: Simulation and Modeling I Output Data Analysis 53

54 Statistical Analysis of Steady-State Simulations (cont.) Example (cont.) moving averages for w = 0: Simulation and Modeling I Output Data Analysis 54

55 Statistical Analysis of Steady-State Simulations (cont.) Independent replications for the analysis of correlated data assume that the length l of the initial transient period has been detected now independent replications (as in the terminating case) make n independent replications each of length m let X j be summary measure of jth replication (discard data from initial transient period) X 1, X,... X n are a random sample construct confidence interval [ X(n) δ(n, α),x(n) + δ(n, α)] rep. 1 l obs. m-l observations X 1 X(n) S (n) δ(n,a) rep. m l obs. m-l observations X n Simulation and Modeling I Output Data Analysis 55

56 Statistical Analysis of Steady-State Simulations (cont.) Independent replications for the analysis of correlated data (cont.) possible to use same/different replications as for detecting initial transient period must have m significantly larger than l factory example n = 10 replications of length m = 160 with removed initial transient period with l = 4 90% confidence interval: [59.51, 60.43] compare with arrival rate! Simulation and Modeling I Output Data Analysis 56

57 Statistical Analysis of Steady-State Simulations (cont.) Independent replications for the analysis of correlated data (cont.) main problem: fixed-sample-size approach m is model-dependent, hard to control relative error decreases if n and m is increased relative error decreases with square root of n recommendations a few replications: n = 5, 10, 0, 40 m as large as possible n=10 n=0 n=30 n=40 E[X(n)] µ (unknown) Simulation and Modeling I Output Data Analysis 57

58 Statistical Analysis of Steady-State Simulations (cont.) Multiple replications in parallel (MRIP) replications as parallel processes run until specified relative error is met (see terminating simulation) conceptually simple user interaction master process - starts and stops simulation engines - collects data, computes statistics slave process 1 - simulation engine - independent RVs - sends data slave process n - simulation engine - independent RVs - sends data Simulation and Modeling I Output Data Analysis 58

59 Statistical Analysis of Steady-State Simulations (cont.) Other approaches for the analysis of correlated data many short runs vs. one long run Many short runs One long run X 1 X 1 X X 3 X 4 X 5 Simulation and Modeling I Output Data Analysis 59

60 Statistical Analysis of Steady-State Simulations (cont.) Other approaches for the analysis of correlated data (cont.) batch means one single long run, the first l observations deleted the remaining observations are divided into n batches of length k = (m-l)/n l obs. batch 1 batch batch n X 1 X X n let X j be sample mean of jth batch if k is large enough, the X 1, X,... X n are independent and the usual techniques can be used main problem: choice of k advantages: simple, initial transient period only once variants: spaced/overlapping/weighted batch means Simulation and Modeling I Output Data Analysis 60

61 Statistical Analysis of Steady-State Simulations (cont.) Other approaches for the analysis of correlated data (cont.) regenerative simulation certain instants (regeneration points) B j can be identified where the process repeats its behavior (probabilistically) observations before and after regeneration points are independent example: single-server queue, arrivals to an empty system estimation based on periods divided by regeneration points hard to find regeneration points in general models D i B 1 =1 B =6 B 3 =8 B 4 =13 B 5 =14 B 6 =0 i Simulation and Modeling I Output Data Analysis 61

62 Statistical Analysis of Steady-State Simulations (cont.) Other approaches for the analysis of correlated data (cont.) sample mean variance estimation directly from correlated data spectral analysis discrete Fourier transformation of observations spectrum in frequency domain variance is estimated from spectrum at zero frequency estimation with good properties sophisticated, not easy to implement autoregressive method, standardized time series two other approaches to estimate variance directly experimental results not as good as for spectral analysis Simulation and Modeling I Output Data Analysis 6

63 Statistical Analysis of Steady-State Simulations (cont.) A reference about the statistical evaluation with more details than in the book of Law/Kelton, together with pseudocode procedures: K. Pawlikowski. Steady-State Simulation of Queueing Processes: A Survey of Problems and Solutions. ACM Computing Surveys, Vol., pp , Simulation and Modeling I Output Data Analysis 63

64 Output Data Analysis Contents Statistic Nature of Simulation Output Parameter Estimation in Statistics Confidence Intervals in Statistics Transient and Steady-State Behavior Statistical Analysis of Terminating Simulations Statistical Analysis of Steady-State Simulations Simulation Control in AnyLogic Simulation and Modeling I Output Data Analysis 64

65 Simulation Control in AnyLogic 6 sequential procedure for terminating and steady-state simulations (see page 4) may be implemented as a Parameter Variation Experiment in AnyLogic 6 example: SSQ (as described in chapter Discrete Simulation) simulation control to be performed over mean waiting time step1 (pane General): set number of runs per iteration to 1 Here, we do not vary any parameters; we set constant expressions. Simulation and Modeling I Output Data Analysis 65

66 Simulation Control in AnyLogic 6 (cont.) sequential procedure for SSQ (cont.) step (pane Replications): check button "use replications" We choose "fixed number of replications" to upper bound their number by say The confidence level is then implicitly fixed to 95%. (The option "varying number of replications" is not well documented and does not allow to specify a relative error.) Simulation and Modeling I Output Data Analysis 66

67 Simulation Control in AnyLogic 6 (cont.) sequential procedure for SSQ (cont.) step3 (pane Advanced): specify what to do after a replication and when to start another one add summary measure of a replication to a Statistics of HistogramData object of the Parameter Variation Experiment stop condition: (getcurrentreplication() > InitialReplications) && (WaitingTimeRep.meanConfidence()/WaitingTimeRep.mean() < RelativeError/(1+RelativeError)) Simulation and Modeling I Output Data Analysis 67

Output Data Analysis for a Single System

Output Data Analysis for a Single System Output Data Analysis for a Single System Chapter 9 Based on the slides provided with the textbook 2 9.1 Introduction Output data analysis is often not conducted appropriately Treating output of a single

More information

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

B. Maddah INDE 504 Discrete-Event Simulation. Output Analysis (1) B. Maddah INDE 504 Discrete-Event Simulation Output Analysis (1) Introduction The basic, most serious disadvantage of simulation is that we don t get exact answers. Two different runs of the same model

More information

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

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr. Simulation Discrete-Event System Simulation Chapter 0 Output Analysis for a Single Model Purpose Objective: Estimate system performance via simulation If θ is the system performance, the precision of the

More information

Chapter 11. Output Analysis for a Single Model Prof. Dr. Mesut Güneş Ch. 11 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 Chapter Output Analysis for a Single Model. Contents Types of Simulation Stochastic Nature of Output Data Measures of Performance Output Analysis for Terminating Simulations Output Analysis for Steady-state

More information

Redacted for Privacy

Redacted for Privacy AN ABSTRACT OF THE THESIS OF Lori K. Baxter for the degree of Master of Science in Industrial and Manufacturing Engineering presented on June 4, 1990. Title: Truncation Rules in Simulation Analysis: Effect

More information

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

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017 CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Quote of the Day A person with one watch knows what time it is. A person with two

More information

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

SEQUENTIAL ESTIMATION OF THE STEADY-STATE VARIANCE IN DISCRETE EVENT SIMULATION SEQUENTIAL ESTIMATION OF THE STEADY-STATE VARIANCE IN DISCRETE EVENT SIMULATION Adriaan Schmidt Institute for Theoretical Information Technology RWTH Aachen University D-5056 Aachen, Germany Email: Adriaan.Schmidt@rwth-aachen.de

More information

2WB05 Simulation Lecture 7: Output analysis

2WB05 Simulation Lecture 7: Output analysis 2WB05 Simulation Lecture 7: Output analysis Marko Boon http://www.win.tue.nl/courses/2wb05 December 17, 2012 Outline 2/33 Output analysis of a simulation Confidence intervals Warm-up interval Common random

More information

Network Simulation Chapter 6: Output Data Analysis

Network Simulation Chapter 6: Output Data Analysis Network Simulation Chapter 6: Output Data Analysis Prof. Dr. Jürgen Jasperneite 1 Contents Introduction Types of simulation output Transient detection When to terminate a simulation 2 Prof. Dr. J ürgen

More information

Slides 12: Output Analysis for a Single Model

Slides 12: Output Analysis for a Single Model Slides 12: Output Analysis for a Single Model Objective: Estimate system performance via simulation. If θ is the system performance, the precision of the estimator ˆθ can be measured by: The standard error

More information

Output Data Analysis for a Single System

Output Data Analysis for a Single System CHAPTER 9 Output Data Analysis for a Single System 9.1 Introduction... 9. Transient and Steady-State Behavior of a Stochastic Process...10 9.3 Types of Simulations with Regard to Output Analysis...1 9.4

More information

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

Chapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation 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,

More information

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

Initial Transient Phase of Steady state Simulation: Methods of Its Length Detection and Their Evaluation in Akaroa2 Initial Transient Phase of Steady state Simulation: Methods of Its Length Detection and Their Evaluation in Akaroa2 A Thesis Submitted in Partial Fulfilment of the Requirement for the Degree of Master

More information

Chapter 11 Estimation of Absolute Performance

Chapter 11 Estimation of Absolute Performance Chapter 11 Estimation of Absolute Performance Purpose Objective: Estimate system performance via simulation If q is the system performance, the precision of the estimator qˆ can be measured by: The standard

More information

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

EE/PEP 345. Modeling and Simulation. Spring Class 11 EE/PEP 345 Modeling and Simulation Class 11 11-1 Output Analysis for a Single Model Performance measures System being simulated Output Output analysis Stochastic character Types of simulations Output analysis

More information

More on Input Distributions

More on Input Distributions More on Input Distributions Importance of Using the Correct Distribution Replacing a distribution with its mean Arrivals Waiting line Processing order System Service mean interarrival time = 1 minute mean

More information

Verification and Validation. CS1538: Introduction to Simulations

Verification and Validation. CS1538: Introduction to Simulations Verification and Validation CS1538: Introduction to Simulations Steps in a Simulation Study Problem & Objective Formulation Model Conceptualization Data Collection Model translation, Verification, Validation

More information

14 Random Variables and Simulation

14 Random Variables and Simulation 14 Random Variables and Simulation In this lecture note we consider the relationship between random variables and simulation models. Random variables play two important roles in simulation models. We assume

More information

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

ESTIMATION AND OUTPUT ANALYSIS (L&K Chapters 9, 10) Review performance measures (means, probabilities and quantiles). ESTIMATION AND OUTPUT ANALYSIS (L&K Chapters 9, 10) Set up standard example and notation. Review performance measures (means, probabilities and quantiles). A framework for conducting simulation experiments

More information

EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 19

EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 19 EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 19 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org (based on Dr. Raj Jain s lecture

More information

Output Analysis for a Single Model

Output Analysis for a Single Model Output Analysis for a Single Model Output Analysis for a Single Model Output analysis is the examination of data generated by a simulation. Its purpose is to predict the performance of a system or to compare

More information

2008 Winton. Statistical Testing of RNGs

2008 Winton. Statistical Testing of RNGs 1 Statistical Testing of RNGs Criteria for Randomness For a sequence of numbers to be considered a sequence of randomly acquired numbers, it must have two basic statistical properties: Uniformly distributed

More information

Outline. Simulation of a Single-Server Queueing System. EEC 686/785 Modeling & Performance Evaluation of Computer Systems.

Outline. Simulation of a Single-Server Queueing System. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 19 Outline Simulation of a Single-Server Queueing System Review of midterm # Department of Electrical and Computer Engineering

More information

7 Variance Reduction Techniques

7 Variance Reduction Techniques 7 Variance Reduction Techniques In a simulation study, we are interested in one or more performance measures for some stochastic model. For example, we want to determine the long-run average waiting time,

More information

Practice Problems Section Problems

Practice Problems Section Problems Practice Problems Section 4-4-3 4-4 4-5 4-6 4-7 4-8 4-10 Supplemental Problems 4-1 to 4-9 4-13, 14, 15, 17, 19, 0 4-3, 34, 36, 38 4-47, 49, 5, 54, 55 4-59, 60, 63 4-66, 68, 69, 70, 74 4-79, 81, 84 4-85,

More information

Simulation. Where real stuff starts

Simulation. Where real stuff starts 1 Simulation Where real stuff starts ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3 What is a simulation?

More information

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

ECE 3511: Communications Networks Theory and Analysis. Fall Quarter Instructor: Prof. A. Bruce McDonald. Lecture Topic ECE 3511: Communications Networks Theory and Analysis Fall Quarter 2002 Instructor: Prof. A. Bruce McDonald Lecture Topic Introductory Analysis of M/G/1 Queueing Systems Module Number One Steady-State

More information

Analysis of Simulated Data

Analysis of Simulated Data Analysis of Simulated Data Media Media di una popolazione: somma di tutti i valori delle variabili della popolazione diviso il numero di unità della popolazione (N) µ N i= = 1 N X i Dove: - N = numero

More information

Variance reduction techniques

Variance reduction techniques Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Simulation with a given accuracy; Variance reduction techniques;

More information

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 Chapter 10 Verification and Validation of Simulation Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose & Overview The goal of the validation process is: To produce a model that

More information

Discrete-event simulations

Discrete-event simulations Discrete-event simulations Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Why do we need simulations? Step-by-step simulations; Classifications;

More information

Part I Stochastic variables and Markov chains

Part I Stochastic variables and Markov chains Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)

More information

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

Contents LIST OF TABLES... LIST OF FIGURES... xvii. LIST OF LISTINGS... xxi PREFACE. ...xxiii LIST OF TABLES... xv LIST OF FIGURES... xvii LIST OF LISTINGS... xxi PREFACE...xxiii CHAPTER 1. PERFORMANCE EVALUATION... 1 1.1. Performance evaluation... 1 1.2. Performance versus resources provisioning...

More information

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

Outline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue. Outline Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue Batch queue Bulk input queue M [X] /M/1 Bulk service queue M/M [Y]

More information

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

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr. 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

More information

Dr. Maddah ENMG 617 EM Statistics 10/15/12. Nonparametric Statistics (2) (Goodness of fit tests)

Dr. Maddah ENMG 617 EM Statistics 10/15/12. Nonparametric Statistics (2) (Goodness of fit tests) Dr. Maddah ENMG 617 EM Statistics 10/15/12 Nonparametric Statistics (2) (Goodness of fit tests) Introduction Probability models used in decision making (Operations Research) and other fields require fitting

More information

Performance Evaluation

Performance Evaluation Performance Evaluation Chapter 5 Short Probability Primer & Obtaining Results (Acknowledgement: these slides have mostly been compiled from [Kar04, Rob0, BLK0]) otivation! Recall:! Usually, a simulation

More information

Sequential Estimation of Quantiles

Sequential Estimation of Quantiles Sequential Estimation of Quantiles Jong-Suk R. Lee, Donald McNickle and Krzysztof P awlikowski Department of Computer Science and Department of Management University of Canterbury Christchurch, New Zealand

More information

Asummary and an analysis are given for an experimental performance evaluation of WASSP, an automated

Asummary and an analysis are given for an experimental performance evaluation of WASSP, an automated INFORMS Journal on Computing Vol. 19, No. 2, Spring 2007, pp. 150 160 issn 1091-9856 eissn 1526-5528 07 1902 0150 informs doi 10.1287/ijoc.1050.0161 2007 INFORMS Performance of a Wavelet-Based Spectral

More information

ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS

ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS Proceedings of the 2013 Winter Simulation Conference R. Pasupathy, S.-H. Kim, A. Tolk, R. Hill, and M. E. Kuhl, eds. ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS Emily K. Lada

More information

Simulation of stationary processes. Timo Tiihonen

Simulation of stationary processes. Timo Tiihonen Simulation of stationary processes Timo Tiihonen 2014 Tactical aspects of simulation Simulation has always a goal. How to organize simulation to reach the goal sufficiently well and without unneccessary

More information

Queueing Theory and Simulation. Introduction

Queueing Theory and Simulation. Introduction Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan

More information

ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS

ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS Emily K. Lada Anup C. Mokashi SAS Institute Inc. 100 SAS Campus Drive, R5413 Cary, NC 27513-8617, USA James R. Wilson North Carolina

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes Midterm Quiz April 6, 2010 There are 5 questions, each with several parts.

More information

Variance reduction techniques

Variance reduction techniques Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/ moltchan/modsim/ http://www.cs.tut.fi/kurssit/tlt-2706/ OUTLINE: Simulation with a given confidence;

More information

On Reaching Nirvana (a.k.a. on Reaching a Steady State) Moshe Pollak Joint work (in progress) with Tom Hope

On Reaching Nirvana (a.k.a. on Reaching a Steady State) Moshe Pollak Joint work (in progress) with Tom Hope On Reaching Nirvana (a.k.a. on Reaching a Steady State) Moshe Pollak Joint work (in progress) with Tom Hope 1 What is Nirvana? "ביקש יעקב אבינו לישב בשלוה" רש"י, בראשית לז 2 the Pursuit of Happiness (US

More information

Simulation. Where real stuff starts

Simulation. Where real stuff starts Simulation Where real stuff starts March 2019 1 ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3

More information

Analyzing Simulation Results

Analyzing Simulation Results Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient

More information

Modeling and Performance Analysis with Discrete-Event Simulation

Modeling and Performance Analysis with Discrete-Event Simulation Simulation Modeling and Performance Analysis with Discrete-Event Simulation Chapter 9 Input Modeling Contents Data Collection Identifying the Distribution with Data Parameter Estimation Goodness-of-Fit

More information

Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama

Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama Instructions This exam has 7 pages in total, numbered 1 to 7. Make sure your exam has all the pages. This exam will be 2 hours

More information

Lecturer: Olga Galinina

Lecturer: Olga Galinina Renewal models Lecturer: Olga Galinina E-mail: olga.galinina@tut.fi Outline Reminder. Exponential models definition of renewal processes exponential interval distribution Erlang distribution hyperexponential

More information

Performance of Skart: A Skewness- and Autoregression-Adjusted Batch-Means Procedure for Simulation Analysis

Performance of Skart: A Skewness- and Autoregression-Adjusted Batch-Means Procedure for Simulation Analysis INFORMS Journal on Computing, to appear. Performance of Skart: A Skewness- and Autoregression-Adjusted Batch-Means Procedure for Simulation Analysis Ali Tafazzoli, James R. Wilson Edward P. Fitts Department

More information

COSC460 Honours Report: A Sequential Steady-State Detection Method for Quantitative Discrete-Event Simulation

COSC460 Honours Report: A Sequential Steady-State Detection Method for Quantitative Discrete-Event Simulation COSC460 Honours Report: A Sequential Steady-State Detection Method for Quantitative Discrete-Event Simulation December 1, 2012 Adam Freeth afr58@uclive.ac.nz Department of Computer Science and Software

More information

SIMULATION OUTPUT ANALYSIS

SIMULATION OUTPUT ANALYSIS 1 / 64 SIMULATION OUTPUT ANALYSIS Dave Goldsman School of ISyE Georgia Tech Atlanta, Georgia, USA sman@gatech.edu www.isye.gatech.edu/ sman April 15, 2016 Outline 1 Introduction 2 Finite-Horizon Simulation

More information

Some Assorted Formulae. Some confidence intervals: σ n. x ± z α/2. x ± t n 1;α/2 n. ˆp(1 ˆp) ˆp ± z α/2 n. χ 2 n 1;1 α/2. n 1;α/2

Some Assorted Formulae. Some confidence intervals: σ n. x ± z α/2. x ± t n 1;α/2 n. ˆp(1 ˆp) ˆp ± z α/2 n. χ 2 n 1;1 α/2. n 1;α/2 STA 248 H1S MIDTERM TEST February 26, 2008 SURNAME: SOLUTIONS GIVEN NAME: STUDENT NUMBER: INSTRUCTIONS: Time: 1 hour and 50 minutes Aids allowed: calculator Tables of the standard normal, t and chi-square

More information

Institute of Actuaries of India

Institute of Actuaries of India Institute of Actuaries of India Subject CT3 Probability & Mathematical Statistics May 2011 Examinations INDICATIVE SOLUTION Introduction The indicative solution has been written by the Examiners with the

More information

M(t) = 1 t. (1 t), 6 M (0) = 20 P (95. X i 110) i=1

M(t) = 1 t. (1 t), 6 M (0) = 20 P (95. X i 110) i=1 Math 66/566 - Midterm Solutions NOTE: These solutions are for both the 66 and 566 exam. The problems are the same until questions and 5. 1. The moment generating function of a random variable X is M(t)

More information

Introduction to Design of Experiments

Introduction to Design of Experiments Introduction to Design of Experiments Jean-Marc Vincent and Arnaud Legrand Laboratory ID-IMAG MESCAL Project Universities of Grenoble {Jean-Marc.Vincent,Arnaud.Legrand}@imag.fr November 20, 2011 J.-M.

More information

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes? IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only

More information

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

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr. Simulation Discrete-Event System Simulation Chapter 8 Input Modeling Purpose & Overview Input models provide the driving force for a simulation model. The quality of the output is no better than the quality

More information

Exercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems

Exercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems Exercises Solutions Note, that we have not formulated the answers for all the review questions. You will find the answers for many questions by reading and reflecting about the text in the book. Chapter

More information

ISyE 6644 Fall 2014 Test 3 Solutions

ISyE 6644 Fall 2014 Test 3 Solutions 1 NAME ISyE 6644 Fall 14 Test 3 Solutions revised 8/4/18 You have 1 minutes for this test. You are allowed three cheat sheets. Circle all final answers. Good luck! 1. [4 points] Suppose that the joint

More information

Discrete-Event System Simulation

Discrete-Event System Simulation Discrete-Event System Simulation FOURTH EDITION Jerry Banks Independent Consultant John S. Carson II Brooks Automation Barry L. Nelson Northwestern University David M. Nicol University of Illinois, Urbana-Champaign

More information

ACCOUNTING FOR INPUT-MODEL AND INPUT-PARAMETER UNCERTAINTIES IN SIMULATION. <www.ie.ncsu.edu/jwilson> May 22, 2006

ACCOUNTING FOR INPUT-MODEL AND INPUT-PARAMETER UNCERTAINTIES IN SIMULATION. <www.ie.ncsu.edu/jwilson> May 22, 2006 ACCOUNTING FOR INPUT-MODEL AND INPUT-PARAMETER UNCERTAINTIES IN SIMULATION Slide 1 Faker Zouaoui Sabre Holdings James R. Wilson NC State University May, 006 Slide From American

More information

Sampling Distributions of Statistics Corresponds to Chapter 5 of Tamhane and Dunlop

Sampling Distributions of Statistics Corresponds to Chapter 5 of Tamhane and Dunlop Sampling Distributions of Statistics Corresponds to Chapter 5 of Tamhane and Dunlop Slides prepared by Elizabeth Newton (MIT), with some slides by Jacqueline Telford (Johns Hopkins University) 1 Sampling

More information

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models Fatih Cavdur fatihcavdur@uludag.edu.tr March 20, 2012 Introduction Introduction The world of the model-builder

More information

Chapter 2 Queueing Theory and Simulation

Chapter 2 Queueing Theory and Simulation Chapter 2 Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University,

More information

Continuous Distributions

Continuous Distributions A normal distribution and other density functions involving exponential forms play the most important role in probability and statistics. They are related in a certain way, as summarized in a diagram later

More information

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

Queueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1 Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to

More information

Introduction to Statistical Data Analysis Lecture 3: Probability Distributions

Introduction to Statistical Data Analysis Lecture 3: Probability Distributions Introduction to Statistical Data Analysis Lecture 3: Probability Distributions James V. Lambers Department of Mathematics The University of Southern Mississippi James V. Lambers Statistical Data Analysis

More information

Lecture 2: Basic Concepts and Simple Comparative Experiments Montgomery: Chapter 2

Lecture 2: Basic Concepts and Simple Comparative Experiments Montgomery: Chapter 2 Lecture 2: Basic Concepts and Simple Comparative Experiments Montgomery: Chapter 2 Fall, 2013 Page 1 Random Variable and Probability Distribution Discrete random variable Y : Finite possible values {y

More information

EMPIRICAL EVALUATION OF DATA-BASED DENSITY ESTIMATION

EMPIRICAL EVALUATION OF DATA-BASED DENSITY ESTIMATION Proceedings of the 2006 Winter Simulation Conference L. F. Perrone, F. P. Wieland, J. Liu, B. G. Lawson, D. M. Nicol, and R. M. Fujimoto, eds. EMPIRICAL EVALUATION OF DATA-BASED DENSITY ESTIMATION E. Jack

More information

Chapter Learning Objectives. Probability Distributions and Probability Density Functions. Continuous Random Variables

Chapter Learning Objectives. Probability Distributions and Probability Density Functions. Continuous Random Variables Chapter 4: Continuous Random Variables and Probability s 4-1 Continuous Random Variables 4-2 Probability s and Probability Density Functions 4-3 Cumulative Functions 4-4 Mean and Variance of a Continuous

More information

Continuous random variables

Continuous random variables Continuous random variables Can take on an uncountably infinite number of values Any value within an interval over which the variable is definied has some probability of occuring This is different from

More information

HITTING TIME IN AN ERLANG LOSS SYSTEM

HITTING TIME IN AN ERLANG LOSS SYSTEM Probability in the Engineering and Informational Sciences, 16, 2002, 167 184+ Printed in the U+S+A+ HITTING TIME IN AN ERLANG LOSS SYSTEM SHELDON M. ROSS Department of Industrial Engineering and Operations

More information

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

The Queue Inference Engine and the Psychology of Queueing. ESD.86 Spring 2007 Richard C. Larson The Queue Inference Engine and the Psychology of Queueing ESD.86 Spring 2007 Richard C. Larson Part 1 The Queue Inference Engine QIE Queue Inference Engine (QIE) Boston area ATMs: reams of data Standard

More information

Design of discrete-event simulations

Design of discrete-event simulations Design of discrete-event simulations Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2707/ OUTLINE: Discrete event simulation; Event advance design; Unit-time

More information

AN ABSTRACT OF THE THESIS OF. Industrial and Manufacturing Engineering presented on December

AN ABSTRACT OF THE THESIS OF. Industrial and Manufacturing Engineering presented on December AN ABSTRAT OF THE THESIS OF Budiman Saleh for the degree of Master of Science in Industrial and Manufacturing Engineering presented on December 12, 1991. Title : Steadv-State Analysis in Simulation : An

More information

Construction Operation Simulation

Construction Operation Simulation Construction Operation Simulation Lecture #8 Output analysis Amin Alvanchi, PhD Construction Engineering and Management Department of Civil Engineering, Sharif University of Technology Outline 2 Introduction

More information

Probability Methods in Civil Engineering Prof. Dr. Rajib Maity Department of Civil Engineering Indian Institution of Technology, Kharagpur

Probability Methods in Civil Engineering Prof. Dr. Rajib Maity Department of Civil Engineering Indian Institution of Technology, Kharagpur Probability Methods in Civil Engineering Prof. Dr. Rajib Maity Department of Civil Engineering Indian Institution of Technology, Kharagpur Lecture No. # 36 Sampling Distribution and Parameter Estimation

More information

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

Bulk input queue M [X] /M/1 Bulk service queue M/M [Y] /1 Erlangian queue M/E k /1 Advanced Markovian queues Bulk input queue M [X] /M/ Bulk service queue M/M [Y] / Erlangian queue M/E k / Bulk input queue M [X] /M/ Batch arrival, Poisson process, arrival rate λ number of customers in

More information

SIMULATION OUTPUT ANALYSIS

SIMULATION OUTPUT ANALYSIS 1 / 71 SIMULATION OUTPUT ANALYSIS Dave Goldsman School of ISyE Georgia Tech Atlanta, Georgia, USA sman@gatech.edu www.isye.gatech.edu/ sman 10/19/17 2 / 71 Outline 1 Introduction 2 A Mathematical Interlude

More information

Preface Introduction to Statistics and Data Analysis Overview: Statistical Inference, Samples, Populations, and Experimental Design The Role of

Preface Introduction to Statistics and Data Analysis Overview: Statistical Inference, Samples, Populations, and Experimental Design The Role of Preface Introduction to Statistics and Data Analysis Overview: Statistical Inference, Samples, Populations, and Experimental Design The Role of Probability Sampling Procedures Collection of Data Measures

More information

Network Simulation Chapter 5: Traffic Modeling. Chapter Overview

Network Simulation Chapter 5: Traffic Modeling. Chapter Overview Network Simulation Chapter 5: Traffic Modeling Prof. Dr. Jürgen Jasperneite 1 Chapter Overview 1. Basic Simulation Modeling 2. OPNET IT Guru - A Tool for Discrete Event Simulation 3. Review of Basic Probabilities

More information

IE 581 Introduction to Stochastic Simulation

IE 581 Introduction to Stochastic Simulation 1. List criteria for choosing the majorizing density r (x) when creating an acceptance/rejection random-variate generator for a specified density function f (x). 2. Suppose the rate function of a nonhomogeneous

More information

Simulation model input analysis

Simulation model input analysis Construction Operation Simulation Lecture #8 Simulation model input analysis Amin Alvanchi, PhD Construction Engineering and Management Department of Civil Engineering, Sharif University of Technology

More information

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010 Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]

More information

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

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr. Simulation Discrete-Event System Simulation Chapter Comparison and Evaluation of Alternative System Designs Purpose Purpose: comparison of alternative system designs. Approach: discuss a few of many statistical

More information

ECON 4130 Supplementary Exercises 1-4

ECON 4130 Supplementary Exercises 1-4 HG Set. 0 ECON 430 Sulementary Exercises - 4 Exercise Quantiles (ercentiles). Let X be a continuous random variable (rv.) with df f( x ) and cdf F( x ). For 0< < we define -th quantile (or 00-th ercentile),

More information

Since D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.

Since D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0. IEOR 46: Introduction to Operations Research: Stochastic Models Chapters 5-6 in Ross, Thursday, April, 4:5-5:35pm SOLUTIONS to Second Midterm Exam, Spring 9, Open Book: but only the Ross textbook, the

More information

1/24/2008. Review of Statistical Inference. C.1 A Sample of Data. C.2 An Econometric Model. C.4 Estimating the Population Variance and Other Moments

1/24/2008. Review of Statistical Inference. C.1 A Sample of Data. C.2 An Econometric Model. C.4 Estimating the Population Variance and Other Moments /4/008 Review of Statistical Inference Prepared by Vera Tabakova, East Carolina University C. A Sample of Data C. An Econometric Model C.3 Estimating the Mean of a Population C.4 Estimating the Population

More information

THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974

THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS by S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This note describes a simulation experiment involving

More information

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

Scheduling I. Today Introduction to scheduling Classical algorithms. Next Time Advanced topics on scheduling Scheduling I Today Introduction to scheduling Classical algorithms Next Time Advanced topics on scheduling Scheduling out there You are the manager of a supermarket (ok, things don t always turn out the

More information

Unit 10: Simple Linear Regression and Correlation

Unit 10: Simple Linear Regression and Correlation Unit 10: Simple Linear Regression and Correlation Statistics 571: Statistical Methods Ramón V. León 6/28/2004 Unit 10 - Stat 571 - Ramón V. León 1 Introductory Remarks Regression analysis is a method for

More information

Chapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations

Chapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations Chapter 5 Statistical Models in Simulations 5.1 Contents Basic Probability Theory Concepts Discrete Distributions Continuous Distributions Poisson Process Empirical Distributions Useful Statistical Models

More information

Computational statistics

Computational statistics Computational statistics Markov Chain Monte Carlo methods Thierry Denœux March 2017 Thierry Denœux Computational statistics March 2017 1 / 71 Contents of this chapter When a target density f can be evaluated

More information

Distributions of Functions of Random Variables. 5.1 Functions of One Random Variable

Distributions of Functions of Random Variables. 5.1 Functions of One Random Variable Distributions of Functions of Random Variables 5.1 Functions of One Random Variable 5.2 Transformations of Two Random Variables 5.3 Several Random Variables 5.4 The Moment-Generating Function Technique

More information

X i. X(n) = 1 n. (X i X(n)) 2. S(n) n

X i. X(n) = 1 n. (X i X(n)) 2. S(n) n Confidence intervals Let X 1, X 2,..., X n be independent realizations of a random variable X with unknown mean µ and unknown variance σ 2. Sample mean Sample variance X(n) = 1 n S 2 (n) = 1 n 1 n i=1

More information

The central limit theorem

The central limit theorem 14 The central limit theorem The central limit theorem is a refinement of the law of large numbers For a large number of independent identically distributed random variables X 1,,X n, with finite variance,

More information

Terminology Suppose we have N observations {x(n)} N 1. Estimators as Random Variables. {x(n)} N 1

Terminology Suppose we have N observations {x(n)} N 1. Estimators as Random Variables. {x(n)} N 1 Estimation Theory Overview Properties Bias, Variance, and Mean Square Error Cramér-Rao lower bound Maximum likelihood Consistency Confidence intervals Properties of the mean estimator Properties of the

More information