|
Pack filling
Fills (via Monte Carlo) a pack with discrete slices. |
|
|
| .mL,
.mU |
g |
Lower and upper limits on the final
mass. |
| μ, σ |
g |
Mean and st. dev. for the mass of each item. • |
| .seed |
|
Seed (repeatability). |
| ymax |
g−1 |
Maximum y for graph (automatic if 0, not '.0'). • |
| Show values |
|
Shows the coordinates of the graph. • |
Simulates, via Monte Carlo, the filling of a pack of discrete slices,
subject to lower and upper final limits (constraints).
An example might be to fill a cylinder with small slices, such as
a pack of thin biscuits. The size (mass, in the example) is considered Gaussian.
In reality, some strategy would be convenient to try to reach
the final sum within the limits, such as choosing the last item
(or the two last items, etc.) to try to meet the limits.
Other suggested data: small increases
in σ (ditto decreases). |
| References: |
Plate: PackFilling |
|
• Con-Weigh Systems,
Packing & Bag Handling.
• 1894-09-30: Struik, Dirk Jan
(2000-10-21). |
