|





]
 CONTENTS

Ú Introduction ± Amit Gupta (183)

Ú Simulation Process ± Sandeep Rai (215)
Ú Monte Carlo Method ± Sahil Raina (214)
Ú Simulation of Inventory system ± Arpit Sharma (188)
Ú Simulation of Queuing system ± Sahil Raina (214)
Ú Advantages & Disadvantages ± Siddharth Shukla (218)

3
V§
 

  
 

ñ §
 

  
   

  

 
     
 
 


ñ §
    
     

Œ £or performance optimization, safety engineering, testing,

training, education, and video games.
ΠScientific modeling of natural systems or human systems in
order to gain insight into their functioning.
ΠTo show the eventual real effects of alternative conditions
and courses of action.
×
Ú 



Ú Physical Simulation
Ú Interactive Simulation/ Human in Loop Simulation

Human in the loop simulations can include a computer simulation as a so

called ?






Ú 

 
Ú 6ne-shot deterministic simulations
Ú Statistical simulations


Ú ë



Ú ë



3


ë
 
 



 CONTDŝ

Ú ‰    

‰    

 

    

Ú 



ë

  

  




 







 
   



  

 



  

   




 §
 

 
Ú It is an abstract framework of a system that facilitates imitating the
behavior of the system over a period of time.
Ú In contrast to mathematical models, simulation models do not need
explicit mathematical functions to relate variables.
Ú Therefore ,they are suitable for representing complex systems to
get a feeling of real system.

Ú 6ne of the greatest advantage of a simulation models is that it can

compress or expand time.

Ú Simulation models can also be used to observe a phenomenon that

cannot be observed at very small intervals of time.

Ú Simulation can also stop continuity of the experiment.

å
 CONTDŝ
Ú Simulation modeling techniques are powerful for
manipulation of time system inputs, and logic.

Ú They are cost effective for modeling a complex system,

and with visual animation capabilities they provide an
effective means of learning, experimenting, and analyzing
real-life complex systems such as £lexible Manufacturing
System.

Ú Simulation are capable of taking care of stochastic

variable without much complexity.

Ú They enable the behavior of the system as a whole to be

predicted
À
Ú Process Interaction Approach
Ú Event Scheduling Approach
Ú d   

d 
Ú ë! d 

"
Ú £

 
  scaled down model
of aeroplanes are built and placed in the wind
tunnels 
 


  

Ú Simulation can be applied to numerous areas
like 

  




  .

]#
 |



   

   


It has four phases:   

]

   
§ 
 

    

! 
 



  


"#

 $ 

   

%
&# 
 
§
  

 
]]
] |


Identify the problem to be simulated

Clearly define the problem

List the 6bjectives that solution is

intended to achieve

]3
 3   

Ú A simulation Model may be

 


 



  .
Ú Mathematical model is preferred over physical model
because it is not expensive and in this mathematical
symbols or equations are used to represent the
relationship in the system

]×
 
!"
Ú Collection of data is very important task in this phase.
Ú The data is needed both for model development and
evaluation.
Ú The type of data needed are directly governed by scope
and extent of the details of simulation.

ë


 
   
 $   

 

]
 × # $%%

e 

     

   
the type of model decides the number of runs needed.
Stochastic type of
Deterministic model, with the Probabilistic type
type of model parameters subject of model is akin
with all its to random to random
variation, number
parameters known of runs are
sampling where
and constant only required to get the each run
a single run clear picture of represents one
would suffice models observation
performance
]
  %

Ú The last step is the analysis and interpretation of the

results of the runs.
Ú The interpretation of the result depends on the extent
to which the simulation model portrays the reality,i.e.
closer the approximation of the real system by
simulation model, lesser will be the need for adjusting
the result and lesser will be the risk inherent in
applying the result.

]
a
 
a



]å
 DEFINITION
Ú d

   
$  



     
  
%  
  
&  
Ú ‰ 
!    
 

Ú d 
 
 

Ú '
  
  

(

(




]À
 | OBLEM SOLUTION

Ú !
 


  

  




 
Ú ) $ 3 

*
 * 

*+

 *
 

]"
 MODEL FO MATION

Ú          
 
  
$ 

Ú ,  

 -

   

        
 -
! 
(



Ú     


  
 

  

3#
 EXAM|LE

Ú     --  

 

 - 
 
Ú 3##  
Ú  

 

. -

   
 

3]

 
 


 

 ]#

å ]

À #

" 3

]# ×À

]] ]3

]3 À

ë  3##

33
 
   ' 
 '



 
 | 

 ##3

 ##

å ##À

À #3

" #×]

]# #]"

]] ##

]3 ##

ë  ]

Thus ,there is 0.02 or 2% chances that 5 cakes would be

demanded that day .
3×
 SIMULATION OF MODEL
Ú ë 


   
   

 
   
  

   

Ú 






/
 ./
Ú /

  

 


 

3
Spinning Arrow

3
 MID SQUA E METHOD

Ú 
  


 





Ú 0

)  
   

 
  


  À"×å(
1$      
å"À"""

 -  

 

À""
3
USING ANDOM VA IABLE TABLE

 
 | 

 ##3

 ##

å ##À

À #3

" #×]

]# #]"

]] ##

]3 ##

ë  ]

3å
 §ë#]

 
 |  
 

 ##3

 ##

å ##À

À #3

" #×]

]# #]"

]] ##

]3 ##

ë  ]

3À

 
 |  


 ##3 ##3

 ## ##å

å ##À #]

À #3 ##

" #×] #å]

]# #]" #"#

]] ## #"

]3 ## ]##

ë  ]

3"

  |  



  


 ##3 ##3
 ## ##å
å ##À #]
À #3 ##
" #×] #å]
]# #]" #"#
]] ## #"
]3 ## ]##

ñ Representing each point of probability by taking

random numbers.

×#

  |  



  


 ##3 ##3 ###]

 ## ##å #3#

å ##À #] #å]

À #3 ## ]×"

" #×] #å] #å#

]# #]" #"# å]À"

]] ## #" "#"

]3 ## ]## """

×]
 §ë#

Ú 6





  
 

(    -
 

 
 



 
Ú 1  





  


 
Ú 2 
×   4
(
 
    


  

×3

  |  



  


 ##3 ##3 ###]

 ## ##å #3#

å ##À #] #å]

À #3 ## ]×"

" #×] #å] #å#

]# #]" #"# å]À"

]] ## #" "#"

]3 ## ]## """

××
 
 


] ] "
3 å ]#
× 3 À
 #× 
 " "
 ] À
å À ]#
À "3 ]]
" 3 "
]# #å å

׏
§
  

 § §

×
 '   
Ú 

 ( 6rdering cost is incurred whenever the
inventory us replenished. It includes costs associated with the
processing and chasing of the purchase order, transportation etc.

Ú D  ( It is the cost associated with the storing an item

in the inventory.

Ú §
 ( It is the cost associated with not serving the
customers. It shows the stock out of an inventory.

Ú [
( It is the delay between the initiation and the

execution of the process.

×
Ô
! 
 

 

$ 

    
   

    
 



   
  


 

 $ 

'   



' 

 Î | 



[
 |  × ##3


 ##À
3 #3#
 #]]
× #×#  #]
å #]"
 #×
À #]×
 #] " #]#
]# ##À
]] ##å
]3 ##
×å
ë

  $) *+


  

 
  )  $  
  )  +
 
 

'
$$
   
(

 
(


   $$ 
    



  
$

×À
'
 
 


 |  
  




× ##3 ##3 ###]
 ##À #]# #3#"
 #]] #3] ]#3#
 #] #×å 3]×
å #]" # ×å
À #]× #" À
" #]# #å" "åÀ
]# ##À #Àå å"À
]] ##å #" Àå"×
]3 ## ]##5 """

×"
 [
 
 

[
 |  
  


  


3 #3# #3# ##]"

× #×# ## 3#"

 #× #À #À

 #] ]## À""

> !  

 

(

  &+  
(


 +  $    
"+  

#
  
  [  

  !  " #
  

# ×#
] À À 33 
3 ]×  å × ]å À# ׏
× #"  ]× 3
 3#  À ]
 å× " # ×" åÀ
 #å  × å#
å "3 ]] 3 À
À "" ]3 å  ]3 À# 3
" "× ]] ] 3
]# ]À  # # À#
]] 3  # # ]3#
]3 33  # ׏ À
]× #å  ×# #
] 3"  3 À
] å À 3 ×  ] À#
3# ×3
# 3##
]
> Total cost= ordering cost + holding cost + shortage cost
= 240 + 550 + 200
= Rs 990

> When the re-order level of 15 units and re-order quantity

of 40 units. The   comes to be ) ,*+.

> When the re-order level is 20 units and the re-order

quantity of 30 units. The   equals to be ) ]+ +.

3
§
   
§ §

×
 d 
  - § 

Ú Arrival times are Poisson distributed while the

service times follow an exponential
distribution.
Ú Such assumptions are often appropriate for the
real life queuing systems, they are not
invariably so.
Ú Thus, formal mathematical analysis can be
very difficult and even impossible.
Ú In that case, Simulation holds the key.

 §
 - § 

Inter ± Arrival Times:


$
 %
&


# ]3

× ]À

 #

" å

]3 ×3

] ]

ë  3##


Probability Distribution of Inter ± Arrival Times:

$
 %
&
 | 

# ]3 ##

× ]À ##"

 # #3

" å #×å

]3 ×3 #]

] ] ##å

ë  3##


Assigning of Random Number Interval:

$
 |  
 

|  


# ## ## ##6 #

× ##" #] #6 ]

 #3 ## ]6 ×"

" #×å #åå # 6 å

]3 #] #"× åå6 "3

] ##å ]## "×6 ""

å
Service Times:

$
 %
&


 À

 3#

À ×

]# ÀÀ

]3 À

ë  3##

À
Probability Distribution of Service Times:


 %
&
 | 

 À ##

 3# #]#

À × #]À

]# ÀÀ #

]3 À #3

ë  3##

"
Assigning of Random Number Interval:



 |  
 


|  


 ## ## ##6 #×

 #]# #] #6 ]×

À #]À #×3 ]6 ×]

]# # #å ×36 å

]3 #3 ]## å6 ""

#
 Selection 6f Random Variables
Ú £or arrival times, the random variables are taken
from 5th major column of the random variable
table.
Ú £or service time, the random variables are
selected from 10th major column of the random
variable table.
Ú Queue length for each interval of the service
times is obtained by considering the number of
mechanics reaching up to the upper limit of that
interval after the one being currently serviced.
]
 §
 .
 
d

 §
  §
  .   -
S.No. R. No. Time 6 R. No. Time Begins Ends Time Length
(mts.) clock (mts.) (mts.)
1 58 9 8:09 60 10 8:09 8:19 00 1
2 47 9 8:18 98 12 8:19 8:31 01 1
3 23 6 8:24 76 12 8:31 8:43 07 2
4 69 9 8:33 53 10 8:43 8:53 10 2
5 35 6 8:39 02 4 8:53 8:57 14 1
6 55 9 8:48 35 10 8:57 9:07 09 1
7 69 9 8:57 94 12 9:07 9:19 10 1
8 90 12 9:09 91 12 9:19 9:31 10 2
9 86 12 9:21 65 10 9:31 9:41 10 1
10 74 9 9:30 20 8 9:41 9:49 11 0
T6TAL 82 mts. 12
3
 )#§/[ë§

Ú Average Waiting Time = 82/10 = 8.2 minutes

Ú Average Queue Length = 12/10 = 1.2
mechanics

×
 ADVANTAGES & DISADVANTAGES

d'
 '

Ú       Ú ë 
  

 
Ú d
  


  
 Ú    
 

Ú 

   


     Ú 7


  
Ú 

   
 
 Ú 
8 
 
Ú 
 
4  

 
  

Ú  

 
$

 CONTDŝ
Ú ‰ -

   Ú 
$
  -
 

 


 

Ú + 
 
 Ú ,  
 
  
 

Ú ë

    
Ú 0     

  
 

  9

 

 
Ú d  
    
Ú  
  

  

Ú 
4 

Ú 
& 
 


 




       



 A||LICATIONS OF SIMULATION

Ú /


    

Ú 7 


 
Ú )
     
Ú * -
  
Ú *




Ú )


  

Ú )

  
Ú  

   

 

Ú *



 



å