ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Using path control variates in activity network simulation
Full text PdfPdf (533 KB)
Source Winter Simulation Conference archive
Proceedings of the 17th conference on Winter simulation table of contents
San Francisco, California, United States
Pages: 217 - 222  
Year of Publication: 1985
ISBN:0-911801-07-3
Authors
Sekhar Venkatraman  School of Industrial Engineering, Purdue University, West Lafayette, Indiana
James R. Wilson  School of Industrial Engineering, Purdue University, West Lafayette, Indiana
Sponsor
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Citation Count: 4
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/21850.253156
What is a DOI?

ABSTRACT

In the simulation of a stochastic activity network (SAN), the usual objective is to obtain point and confidence-interval estimators of the mean completion time for the network. This paper presents a new procedure for using path control variates to improve the efficiency of such estimators. Because each path control is the duration of an associated path in the network, the vector of selected path controls has both a known mean and a known covariance matrix. All of this information is incorporated into point- and interval-estimation procedures for both normal and nonnormal responses. To evaluate the performance of these procedures experimentally, we compare actual versus predicted reductions in point-estimator variance and confidence-interval half-length for a set of SANs in which the following characteristics are systematically varied: (a) the size of the network (number of nodes and activities); (b) the topology of the network; (c) the relative dominance (criticality index) of the critical path; and (d) the percentage of activities with exponentially distributed durations. The experimental results indicate that large variance reductions can be achieved with these estimation procedures in a wide variety of networks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Wilson, $. R. and Prltsker, A. A. B. Variance Reductlon In Queuelng Simulation using Generalized Con= comltant Variables, Journal of Statistical Computation and Simulation, 19 , 1984, 129-153.
 
2
Sullivan, R. S., Hayya, J. C., and $chaul, R. Efficiency of the Ant, l~hetlc Varlate Method for Slmu= laLlng Stochastic Ne~worLs, Management Science, 28 1982, 563-572.
 
3
Grunt, F. H. and Solberg, J. J. Variance Reduction Techniques In Stochastic Shortest Rouge Analysis: Application Procedures and Results, i~lathematics and Computers in Simulation, 25, 1983, 366-375.
 
4
Lavenberg, S. S., Moeller, T. L., and Welch, P. D. Statistical Results on Control Variables wlth Appllca= ~lon to Queuelng Network Simulation, Operations ResearcJ~, 30, 1982, 182=202.
 
5
 
6
Erron, B. The Jackknife, the Bootstrap and Other Resamp2ing Plans. Soclety for Indust, rlal and Applled Mathematics, Philadelphia, Penrtsylvanlu, 1982.
 
7
 
8
Elmaghraby, $. E. Activity Networks, Wiley- Intersctence, New York, 1977.
 
9
Antlll, J. M., Woodheud, R. W. Critical Path Methods in Construction Practice, John Wiley, New York, 1982.
 
10
McKenney, J. L., Rosenbloom, R. S. Cases in Operations Management, John Wiley, New York, 1909.

Collaborative Colleagues:
Sekhar Venkatraman: colleagues
James R. Wilson: colleagues