This class simulates a specific stochastic activity network with 9 nodes and 13 links, taken from Elmaghraby (1977) and used again in L'Ecuyer and Lemieux (2000), "Variance Reduction via Lattice Rules". More...
Public Member Functions | |
| void | simulate (RandomStream stream) |
| Simulates the model for one run. | |
| double | getPerformance () |
| Recovers and returns the realization of the performance measure, of type double. | |
| String | toString () |
| Returns a description of the model and its parameters. | |
| String | getTag () |
| Returns a short model name (tag) to be used in reports. | |
This class simulates a specific stochastic activity network with 9 nodes and 13 links, taken from Elmaghraby (1977) and used again in L'Ecuyer and Lemieux (2000), "Variance Reduction via Lattice Rules".
The goal is to estimate the distribution of the length T of the shortest path and make a histogram. This program is very specific to this example and uses a very naive way to compute the shortest path, by enumerating all six paths!
Definition at line 22 of file San13Dist.java.
| double tutorial.San13Dist.getPerformance | ( | ) |
Recovers and returns the realization of the performance measure, of type double.
Implements umontreal.ssj.mcqmctools.MonteCarloModelDouble.
Definition at line 85 of file San13Dist.java.
| String tutorial.San13Dist.getTag | ( | ) |
Returns a short model name (tag) to be used in reports.
Implements umontreal.ssj.mcqmctools.MonteCarloModelDouble.
Definition at line 95 of file San13Dist.java.
| void tutorial.San13Dist.simulate | ( | RandomStream | stream | ) |
Simulates the model for one run.
Implements umontreal.ssj.mcqmctools.MonteCarloModelDouble.
Definition at line 59 of file San13Dist.java.
| String tutorial.San13Dist.toString | ( | ) |
Returns a description of the model and its parameters.
Implements umontreal.ssj.mcqmctools.MonteCarloModelDouble.
Definition at line 89 of file San13Dist.java.