“…A second way, called stochastic (random) initialization, tries to estimate the steady-state probability distribution of the process, possibly from pilot runs, and then uses this estimated distribution to sample the initial conditions. Madansky (1976) shows that initializing an M/M/1 queue in empty and idle state, which is Gafarian et al (1978), Wilson and Pritsker (1978a,b), Chance (1993), Fishman (1972, Kleijnen (1984), Law (1984), Nelson (1990Nelson ( , 1992, Cash et al (1992), Ma and Kochhar (1993) Intelligent initialization Deterministic initialization Madansky (1976), Kelton and Law (1985), Kelton (1985), Murray and Kelton (1988a) Stochastic initialization Kelton (1989), Murray (1988), Murray and Kelton (1988b) Schruben (1981Schruben ( , 1982, Schruben et al (1983), Goldsman et al (1994), Vassilacopoulus (1989) Analytical techniques Kelton and Law (1983), Asmussen et al (1992), Gallagher et al (1996), White (1997), Spratt (1998), White et al (2000) the mode of the number-in-system distribution, minimizes the MSE of the point estimate. For M/M/s, M/E m /1, M/E m /2, and E m /M/2 queues, Kelton and Law (1985), Kelton (1985), and Murray and Kelton (1988a) find that initializing in a state at least as congested as the steady-state mean (as opposed to the mode) induces shorter transient periods.…”