You are on page 1of 4
- wwe © unl On a computer in order to obtain Operaurunar sve-— cee The precise definition by Shannaon is ; “Simulation is the process of oa — model of a real system and conducting experiments with the model for EP of understanding the behaviour for the operation of the system- According te OW. Ee |. STEPS IN SIMULATION In the following figure, steps of simula Steps for Simulation [)__ Formation of Problem Introduce important variables, decision rules of system parameters | © Perform Simulation Is Simulation Process is Complete ? ‘Select the best Course || of action | From the above, process, we have seen: that the ayatam. consists of several stages. The n are illustrated “ jiATION MODELS coHMOUES, siete for mplen to ‘at solution, tf must bo emphasize t lag forever lpticl sation ee nerati Toe cry be un ani in & Generation of Data. o — further anal, can experiment i conduc we ea poner ane 7. Modif tacking sampling to conducting ae » tectsot ord iterfere with the real world system. Sponge acme bur erheroenemany ere) 11. Last Resort. Simulation, sometime is the last resort to solve impossi eg. ifweareunabletyo 2 ihe are unablew observe the actual envronmentson the planet DISADVANTAGES (DEMERITS) 1. Not Precise. Simulation is not precio and i doesnot yield an answer cree tae ater meena 2, Expensive, Developing a simulation modal can be very expensive eeause ii 109g ExPoonnpticated precens to develop a model Sometimes, iemay take years to dezelop model. Hence huge expenditure ar involved 3, No Optimum Solution. Unlike other quanttative techniques, simulation dows nok aera ptina solution to the problem. is tal & eror approach hence it ‘oduce differen solution tothe same problem 44, Nou 'Transferable Solution, Each solution model is unique and its sol ‘Mfaronces ean not be transferable to other problems. 5, Inefficient. Solution method of simulation model quantitative methods. be problems. mulation but provide a lution and are not as efficient as other opERATIONS RESEARCH AND QUANTITATIVE TECHNIQUES 50 son cate adioe oa great extent, which indies 6. ae: enue sane pebiydrinom Vv. MONTE-CARLO SIMULATION TECHNIQUE onte-carto Simulation / Lane Jo method may he applied whe ayntom contains elements that exhibit chance ioteceromedin ny teapot ean Tn echniave wes adem ue ie nang and where mathemati formation ima ie A yy Vn Newman and SM. Mam. Teiquy meh Mente cy ce fr anata teen Freak down into 6 following steps ; aren ray De spac 1 Esta Pe orate, hore are number of variable ra) won teat ean hae ewan to simulate the m, wareheg st tht are rain nas ty and ime for nventory order to arive (time ween machine break down (d) time between ‘arrivals and users (e) service time ete. re pubiity distribution to examine, vedtermin the to determine aa historical observation, bas at machine break down may ‘distribution can be empirical or For the abovesa variables, wea histor al cateone, Prubabilty datibution nes Tiere on udgement & experience esa Ae Notrente peubebility for these variables. Probability mma or binomial or poisson or exponential pattern ‘Step 2. Cummulative Probability Distribution. From the regular probability siseuttn wecan ariveat the cummulatie probability distribution of every job. Curmmalative pests fonts ae roby enn aed the previous summative probabil ‘Stop 5 Setting Random Number Intervals. Monte-carlo simulation have established cummultive probably distribution foreach variable. It requires generation ofa sequence of Sandor numbers. Random numbers of a series of digits say one digit, two digits ete. eit we reinterested in one digit number there are ony ten such numbers. And if we want to generate "umber, then chanee of that number should be 1/10, These random numbers are called pseudo ‘ann mbes Random numbers ar geerted singe dal omputers these day, amit cmmiatv probability dtibtion computed wecansetntarvals random Step 4. Generating Random Numbers. Random numbers may be sae the rb ret notes thousand of simulation tals. rhe simulation {he nur maybe sleced that has 100 fots randomly from the ran can feet numbers om any where inthe table, These random numbers are Selected nach ca {hat ee no ean qual proba Iselotion fom agit random number table {vena the end ofthis chaptes) these numbers may be choosen from any fashion, Seley rows or diagonals, we can select our num ion. Selectin Example 1. Remote nn thes wont)

You might also like