San13Dist Class Reference

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...

Inheritance diagram for San13Dist:

Collaboration diagram for San13Dist:

Public Member Functions
	San13Dist (String fileName) throws IOException
void	readDistributions (String fileName) throws IOException
int	getDimension ()
double	deterministicLengths ()
void	simulate (RandomStream stream)
	Simulates the model for one run.
double	computePathsAndT ()
double	getPerformance ()
	Recovers and returns the realization of the performance measure, of type double.
String	toString ()
	Returns a short description of the model and its parameters.

Static Public Member Functions
static void	main (String[] args) throws IOException

Package Attributes
int	dim = 13
double []	V = new double[dim]
ContinuousDistribution []	dist = new ContinuousDistribution[dim]
double []	paths = new double[6]
double	maxPath

Detailed Description

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!

---

The documentation for this class was generated from the following file:

• San13Dist.java