Monte Carlo simulation methods for dynamic line layout problems with nonlinear movement costs

2010 ◽  
Vol 4 (1) ◽  
pp. 40 ◽  
Author(s):  
Wai Kin Victor Chan ◽  
Charles J. Malmborg
Keyword(s):  
Monte Carlo Simulation ◽  
Monte Carlo ◽  
Simulation Methods

Comparison of Monte Carlo simulation methods for the calculation of the nucleation barrier of argon

2006 ◽  
Vol 82 (3-4) ◽  
pp. 489-502 ◽  
Author(s):  
Antti Lauri ◽  
Joonas Merikanto ◽  
Evgeni Zapadinsky ◽  
Hanna Vehkamäki
Keyword(s):  
Monte Carlo Simulation ◽  
Monte Carlo ◽  
Simulation Methods ◽  
Nucleation Barrier

scholarly journals Estimating a size‐specific dose for helical head CT examinations using Monte Carlo simulation methods

2018 ◽  
Vol 46 (2) ◽  
pp. 902-912 ◽  
Author(s):  
Anthony J. Hardy ◽  
Maryam Bostani ◽  
Andrew M. Hernandez ◽  
Maria Zankl ◽  
Cynthia McCollough ◽  
...  
Keyword(s):  
Monte Carlo Simulation ◽  
Monte Carlo ◽  
Simulation Methods ◽  
Head Ct

scholarly journals Nested Monte Carlo study of random packing on the sphere

1991 ◽  
Vol 28 (3) ◽  
pp. 539-552 ◽  
Author(s):  
R. P. C. Rodgers ◽  
A. J. Baddeley
Keyword(s):  
Monte Carlo Simulation ◽  
Monte Carlo ◽  
Branching Process ◽  
Transition Probabilities ◽  
Exact Analytical Solution ◽  
Monte Carlo Study ◽  
Random Packing ◽  
Simulation Methods ◽  
Unit Radius ◽  
Random Spheres

We consider two random sequential packing processes in which spheres of unit radius are randomly attached to the surface of a fixed unit sphere. Independent random spheres are generated and added successively, provided there is no overlap with previous spheres. In model 1, the process stops when a trial sphere intersects one of the previously-accepted spheres. In model 2, random sequential packing, any such overlapping trial sphere is discarded and the next random sphere is tried, until it is impossible to add any further spheres.Previous workers have conjectured convincingly that no exact analytical solution is possible for this type of problem. We use Monte Carlo simulation methods to estimate transition probabilities for the two models. Because some probabilities are extremely small, a simulation using independent repetitions of the model would be inefficient. We designed a branching process of conditionally binomial trials, and performed over 108 trials on a supercomputer.

Sign in / Sign up

Export Citation Format

Share Document