IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v61y2010i11d10.1057_jors.2009.121.html
   My bibliography  Save this article

Automated selection of the number of replications for a discrete-event simulation

Author

Listed:
  • K Hoad

    (Warwick Business School, University of Warwick)

  • S Robinson

    (Warwick Business School, University of Warwick)

  • R Davies

    (Warwick Business School, University of Warwick)

Abstract

Selecting an appropriate number of replications to run with a simulation model is important in assuring that the desired accuracy and precision of the results are attained with minimal effort. If too few are selected then accuracy and precision are lost; if too many are selected then valuable time is wasted. Given that simulation is often used by non-specialists, it seems important to provide guidance on the number of replications required with a model. In this paper an algorithm for automatically selecting the number of replications is described. Test results show the algorithm to be effective in obtaining coverage of the expected mean at a given level of precision and in reducing the bias in the estimate of the mean of the simulation output. The algorithm is consistent in selecting the expected number of replications required for a model output.

Suggested Citation

  • K Hoad & S Robinson & R Davies, 2010. "Automated selection of the number of replications for a discrete-event simulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1632-1644, November.
    • Handle: RePEc:pal:jorsoc:v:61:y:2010:i:11:d:10.1057_jors.2009.121
    DOI: 10.1057/jors.2009.121
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2009.121
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jors.2009.121?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Averill M. Law & W. David Kelton, 1982. "Confidence Intervals for Steady-State Simulations II: A Survey of Sequential Procedures," Management Science, INFORMS, vol. 28(5), pages 550-562, May.
    2. George S. Fishman, 1978. "Grouping Observations in Digital Simulation," Management Science, INFORMS, vol. 24(5), pages 510-521, January.
    3. Averill M. Law & W. David Kelton, 1984. "Confidence Intervals for Steady-State Simulations: I. A Survey of Fixed Sample Size Procedures," Operations Research, INFORMS, vol. 32(6), pages 1221-1239, December.
    4. R C H Cheng, 2006. "Validating and comparing simulation models using resampling," Journal of Simulation, Taylor & Francis Journals, vol. 1(1), pages 53-63, December.
    5. George S. Fishman, 1971. "Estimating Sample Size in Computing Simulation Experiments," Management Science, INFORMS, vol. 18(1), pages 21-38, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zdeněk Zmeškal & Dana Dluhošová & Karolina Lisztwanová & Antonín Pončík & Iveta Ratmanová, 2023. "Distribution Prediction of Decomposed Relative EVA Measure with Levy-Driven Mean-Reversion Processes: The Case of an Automotive Sector of a Small Open Economy," Forecasting, MDPI, vol. 5(2), pages 1-19, May.
    2. Matinrad, Niki & Granberg, Tobias Andersson, 2023. "Optimal pre-dispatch task assignment of volunteers in daily emergency response," Socio-Economic Planning Sciences, Elsevier, vol. 87(PB).
    3. Utomo, D.S. & Gripton, A. & Greening, P., 2021. "Analysing charging strategies for electric LGV in grocery delivery operation using agent-based modelling: An initial case study in the United Kingdom," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 148(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Halkos, George & Kevork, Ilias, 2002. "Confidence intervals in stationary autocorrelated time series," MPRA Paper 31840, University Library of Munich, Germany.
    2. Halkos, George & Kevork, Ilias, 2006. "Estimating population means in covariance stationary process," MPRA Paper 31843, University Library of Munich, Germany.
    3. Holthaus, Oliver & Rajendran, Chandrasekharan, 1997. "Efficient dispatching rules for scheduling in a job shop," International Journal of Production Economics, Elsevier, vol. 48(1), pages 87-105, January.
    4. Robinson, Stewart, 2007. "A statistical process control approach to selecting a warm-up period for a discrete-event simulation," European Journal of Operational Research, Elsevier, vol. 176(1), pages 332-346, January.
    5. Yu Hang Jiang & Tong Liu & Zhiya Lou & Jeffrey S. Rosenthal & Shanshan Shangguan & Fei Wang & Zixuan Wu, 2022. "Markov Chain Confidence Intervals and Biases," International Journal of Statistics and Probability, Canadian Center of Science and Education, vol. 11(1), pages 1-29, March.
    6. Lada, Emily K. & Wilson, James R., 2006. "A wavelet-based spectral procedure for steady-state simulation analysis," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1769-1801, November.
    7. Song, Wheyming Tina, 1996. "On the estimation of optimal batch sizes in the analysis of simulation output," European Journal of Operational Research, Elsevier, vol. 88(2), pages 304-319, January.
    8. Natalie M. Steiger & James R. Wilson, 2001. "Convergence Properties of the Batch Means Method for Simulation Output Analysis," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 277-293, November.
    9. Mingchang Chih, 2019. "An Insight into the Data Structure of the Dynamic Batch Means Algorithm with Binary Tree Code," Mathematics, MDPI, vol. 7(9), pages 1-8, August.
    10. J Martens & R Peeters & F Put, 2009. "Analysing steady-state simulation output using vector autoregressive processes with exogenous variables," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(5), pages 696-705, May.
    11. D'Angelo, Andrea & Gastaldi, Massimo & Levialdi, Nathan, 2000. "Production variability and shop configuration: An experimental analysis," International Journal of Production Economics, Elsevier, vol. 68(1), pages 43-57, October.
    12. Ayvaz, Berk & Bolat, Bersam & Aydın, Nezir, 2015. "Stochastic reverse logistics network design for waste of electrical and electronic equipment," Resources, Conservation & Recycling, Elsevier, vol. 104(PB), pages 391-404.
    13. T. S. Raghu & P. K. Sen & H. R. Rao, 2003. "Relative Performance of Incentive Mechanisms: Computational Modeling and Simulation of Delegated Investment Decisions," Management Science, INFORMS, vol. 49(2), pages 160-178, February.
    14. Song, Wheyming T. & Chih, Mingchang, 2010. "Extended dynamic partial-overlapping batch means estimators for steady-state simulations," European Journal of Operational Research, Elsevier, vol. 203(3), pages 640-651, June.
    15. S Robinson & T Alifantis & J S Edwards & J Ladbrook & A Waller, 2005. "Knowledge-based improvement: simulation and artificial intelligence for identifying and improving human decision-making in an operations system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 912-921, August.
    16. Logendran, Rasaratnam & Talkington, Diane, 1997. "Analysis of cellular and functional manufacturing systems in the presence of machine breakdown," International Journal of Production Economics, Elsevier, vol. 53(3), pages 239-256, December.
    17. L. Lambertini & R. Orsini, 1998. "Monopoly, Quality, and Network Externalities," Working Papers 334, Dipartimento Scienze Economiche, Universita' di Bologna.
    18. Srinagesh Gavirneni & Douglas J. Morrice & Peter Mullarkey, 2004. "Simulation Helps Maxager Shorten Its Sales Cycle," Interfaces, INFORMS, vol. 34(2), pages 87-96, April.
    19. Song, Wheyming Tina & Chih, Mingchang, 2013. "Run length not required: Optimal-mse dynamic batch means estimators for steady-state simulations," European Journal of Operational Research, Elsevier, vol. 229(1), pages 114-123.
    20. K Hoad & S Robinson & R Davies, 2010. "Automating warm-up length estimation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1389-1403, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:61:y:2010:i:11:d:10.1057_jors.2009.121. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.