WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 25 Simulation.

Slides:



Advertisements
Similar presentations
McGraw-Hill/Irwin Copyright © 2013 by The McGraw-Hill Companies, Inc. All rights reserved. A PowerPoint Presentation Package to Accompany Applied Statistics.
Advertisements

BU BU Decision Models Simulation1 Simulation Summer 2013.
Exponential Distribution. = mean interval between consequent events = rate = mean number of counts in the unit interval > 0 X = distance between events.
Lab Assignment 1 COP 4600: Operating Systems Principles Dr. Sumi Helal Professor Computer & Information Science & Engineering Department University of.
(Monté Carlo) Simulation
ฟังก์ชั่นการแจกแจงความน่าจะเป็น แบบไม่ต่อเนื่อง Discrete Probability Distributions.
Statistics for Managers Using Microsoft Excel, 4e © 2004 Prentice-Hall, Inc. Chap 5-1 Chapter 5 Some Important Discrete Probability Distributions Statistics.
Lecture 10 – Introduction to Probability Topics Events, sample space, random variables Examples Probability distribution function Conditional probabilities.
Review of Basic Probability and Statistics
Simulation A Queuing Simulation. Example The arrival pattern to a bank is not Poisson There are three clerks with different service rates A customer must.
Classification of Simulation Models
Random-Variate Generation. Need for Random-Variates We, usually, model uncertainty and unpredictability with statistical distributions Thereby, in order.
#11 QUEUEING THEORY Systems Fall 2000 Instructor: Peter M. Hahn
Simulation Modeling and Analysis
Probability Distributions Finite Random Variables.
1 Review of Probability Theory [Source: Stanford University]
Simulation.
Probability and Statistics Review
Simulating Single server queuing models. Consider the following sequence of activities that each customer undergoes: 1.Customer arrives 2.Customer waits.
Lecture 4 Mathematical and Statistical Models in Simulation.
Computer Simulation A Laboratory to Evaluate “What-if” Questions.
Simulation Examples ~ By Hand ~ Using Excel
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
Random variables Petter Mostad Repetition Sample space, set theory, events, probability Conditional probability, Bayes theorem, independence,
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
ST3236: Stochastic Process Tutorial 10
Chapter 5 Statistical Models in Simulation
Winter 2006EE384x1 Review of Probability Theory Review Session 1 EE384X.
5-1 Business Statistics: A Decision-Making Approach 8 th Edition Chapter 5 Discrete Probability Distributions.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 27 Simulation.
4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution.
Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.
Entities and Objects The major components in a model are entities, entity types are implemented as Java classes The active entities have a life of their.
Lecture 19 Nov10, 2010 Discrete event simulation (Ross) discrete and continuous distributions computationally generating random variable following various.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 24 Simulation.
Simulation Examples and General Principles
Copyright ©2011 Pearson Education, Inc. publishing as Prentice Hall 5-1 Business Statistics: A Decision-Making Approach 8 th Edition Chapter 5 Discrete.
ETM 607 – Random-Variate Generation
Reid & Sanders, Operations Management © Wiley 2002 Simulation Analysis D SUPPLEMENT.
Computer Simulation. The Essence of Computer Simulation A stochastic system is a system that evolves over time according to one or more probability distributions.
M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...
Random Variables Example:
Simulation. Inverse Functions Actually, we’ve already done this with the normal distribution.
Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
CDA6530: Performance Models of Computers and Networks Chapter 8: Statistical Simulation ---- Discrete Event Simulation (DES) TexPoint fonts used in EMF.
MODELING AND SIMULATION CS 313 Simulation Examples 1.
Module 9.4 Random Numbers from Various Distributions -MC requires the use of unbiased random numbers.
Chapter 2 Simulation Examples. Simulation steps using Simulation Table 1.Determine the characteristics of each of the inputs to the simulation (probability.
Modeling and Simulation
CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics B: Michael Baron. Probability and Statistics for Computer Scientists,
Queuing Theory. Model Customers arrive randomly in accordance with some arrival time distribution. One server services customers in order of arrival.
Random number generation
18 Management of Waiting Lines
Prepared by Lloyd R. Jaisingh
Simulation Statistics
ETM 607 – Spreadsheet Simulations
Modeling and Simulation CS 313
Lecture on Markov Chain
Birth-Death Process Birth – arrival of a customer to the system
Delays Deterministic Stochastic Assumes “error free” type case
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
LESSON 12: EXPONENTIAL DISTRIBUTION
Probability Review for Financial Engineers
COMP60611 Fundamentals of Parallel and Distributed Systems
Lecture 5 b Faten alamri.
Delays Deterministic Stochastic Assumes “error free” type case
Chapter 3 : Random Variables
VIRTUE MARYLEE MUGURACHANI QUEING THEORY BIRTH and DEATH.
Presentation transcript:

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 25 Simulation

Review Simulation: used to imitate the real system using computer software, helpful when system is too complex or has many stochastic elements Discrete event simulation: if the state of the system changes at random points in time as a result of various events Different probability distributions are used for different purposes Nov 5, 2012Wood Saba Vahid2

Distributions Various probability distributions are used for different random events Poisson : distribution of number of arrivals per unit of time Exponential : distribution of time between successive events (arrivals, serving customers,…) Uniform: for random number generation Normal : for some physical phenomenon's, normally used to represent the distributions of the means of observations from other distributions Binomial: coin flip … Nov 5, 2012Wood Saba Vahid3

Cumulative Distribution Function (CDF) Nov 5, 2012Wood Saba Vahid4 f(x) F(x) x x 1.0 t t Highlighted area: P(x<=t) P(x<=t)

Example 16 – A discrete event simulation Simulate a queuing system : –One server –Customers arrive according to a Poisson distribution (mean arrival rate λ = 3 per hour) –Service rate changes according to a Poisson distribution (mean service rate μ = 5 customers per hour) Nov 5, 2012Wood Saba Vahid5

Probability reminder Nov 5, 2012Wood Saba Vahid6

Example 16 – Queuing system State of the system at each time t – N(t) = number of customers in the queue at time t Random events in the simulation: –Arrival of customers (mean inter arrival times are 1/3 hour) –Serving the customers (mean service times are 1/5 hour) System transition formula: –Arrival: reset N(t) to N(t)+1 –Serve customer: reset N(t) to N(t)-1 How to change the simulation clock (2 ways) : 1.Fixed-time increment 2.Next-event increment Nov 5, 2012Wood Saba Vahid7

Fixed-time increment for Example 16 Nov 5, 2012Wood Saba Vahid8

Using random numbers to generate events To see if the events should occur or not, we use a random number generator to generate a uniform random number between [0,1] (e.g. in Excel there is a RAND() function that does this) If the random number is less than the calculated probability (in previous slide) we accept the event, if not we reject it. let’s assume we’ve generated a random number for the arrival of customers with Rand() function, random_A= Random_A < so we accept the arrival We must generate a new random number for each case, so let’s assume random_D= Random_D >= so we reject the departure N(1) = N(0)+ 1 (arrival) – 0 (departure) = 0+1=1 Nov 5, 2012Wood Saba Vahid9 Example 16