Evaluating variance reduction techniques within a sample average approximation method for a constrained inventory policy optimization problem
Pages 1629 - 1640
Abstract
This paper examines a constrained stochastic inventory optimization problem by means of sample average approximations (SAA). The problem is formulated based on the lead time demand parameters. Lead time demands are sampled by a bootstrap method that is performed by randomly generating demand values over deterministic lead time values. In order to increase the efficiency of solving an SAA replication, a number of variance reduction techniques (VRT) are proposed, namely: antithetic variates, common random numbers and Latin hypercube sampling methods. A set of experiments investigates the quality of these VRTs on the estimated optimality gap and gap variance results for different demand processes. The results indicate that the use of VRTs produces significant improvements over the crude Monte Carlo sampling method on all test cases.
References
[1]
Agrawal, V., and S. Seshadri. 2000. "Distribution free bounds for service constrained (r, q) inventory systems". Naval Research Logistics 47:635--656.
[2]
Ahmed, S., and A. Shapiro. 2002. "The Sample Average Approximation Method for Stochastic Programs with Integer Recourse". Technical report, Georgia Institute of Technology.
[3]
Axsäter, S. 2006. Inventory Control. Springer, New York.
[4]
Federgruen, A., and Y. S. Zheng. 1992. "An Efficient Algorithm for Computing an Optimal (r, Q) Policy in Continuous Review Stochastic Inventory Systems". Operations Research 40:808--813.
[5]
Freimer, M. B., D. J. Thomas, and T. Linderoth. 2010. "The impact of sampling methods on bias and variance in stochastic linear programs". Computational Optimization and Applications 46:1--25.
[6]
Greenwald, A., B. Guillemette, V. Naroditskiy, and M. Tschantz. 2006. "Scaling Up the Sample Average Approximation Method for Stochastic Optimization with Applications to Trading Agents". Lecture Notes in Computer Science 3937:187--199.
[7]
Hsu, J. C. 1981. "Simultaneous confidence intervals for all distances from the "best"". Annals of Statistics 9:1026--1034.
[8]
Kleywegt, A. J., and A. Shapiro. 2001. "The sample average approximation method for stochastic discrete optimization". SIAM Journal on Optimization:502.
[9]
Kramer, C. Y. 1956. "Extension of multiple range tests to group means with unequal number of replications". Biometrics 12:307--310.
[10]
Law, A. M., and D. M. Kelton. 1999. Simulation Modeling and Analysis. 3rd ed. McGraw-Hill Higher Education.
[11]
Linderoth, J., A. Shapiro, and S. Wright. 2006, February. "The empirical behavior of sampling methods for stochastic programming". Annals of Operations Research 142 (1): 215--241.
[12]
Mak, W.-K., D. P. Morton, and R. K. Wood. 1999. "Monte Carlo bounding techniques for determining solution quality in stochastic programs". Operations Research Letters 24 (1-2): 47--56.
[13]
Matala, A. 2008. "Sample Size Requierement for Monte Carlo -- simulations using Latin Hypercube Sampling". Technical report, Helsinki University of Technology, Department of Engineering Physics and Mathematics.
[14]
Rossetti, M., and Y. Ünlü. 2011. "Evaluating the Robustness of Lead Time Demand Models". The International Journal of Production Economics 134:159--176.
[15]
Tukey, J. W. 1953. The Collected Works of John W. Tukey VIII. Multiple Comparisons: 1948--1983. Chapman & Hall, New York.
[16]
Zipkin, P. 2000. Foundations of Inventory Management. McGraw-Hill, New York.
Index Terms
- Evaluating variance reduction techniques within a sample average approximation method for a constrained inventory policy optimization problem
Recommendations
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation--based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and the expected value function is approximated by the corresponding ...
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average ...
Variance reduction in sample approximations of stochastic programs
This paper studies the use of randomized Quasi-Monte Carlo methods (RQMC) in sample approximations of stochastic programs. In numerical integration, RQMC methods often substantially reduce the variance of sample approximations compared to Monte Carlo (...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
- IIE: Institute of Industrial Engineers
- INFORMS-SIM: Institute for Operations Research and the Management Sciences: Simulation Society
- SCS: Shanghai Computer Society
- SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
Winter Simulation Conference
Publication History
Published: 11 December 2011
Check for updates
Qualifiers
- Research-article
Conference
WSC'11
Sponsor:
- IIE
- INFORMS-SIM
- SCS
- SIGSIM
Acceptance Rates
WSC '11 Paper Acceptance Rate 203 of 270 submissions, 75%;
Overall Acceptance Rate 3,413 of 5,075 submissions, 67%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 45Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 29 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in