Answers are grounded in this paper and cite their sources.
Various methods have been proposed to conduct optimization via discrete-event simulation. Prevalent among these are gradient-based algorithms, and more recently, so-called retrospective approaches that deterministically optimize over simulated outcomes. In this paper we compare and contrast the performance of these two approaches for the optimization of a periodic review (s S) inventory system. In practice, gradient-based methods often exhibit undesirably slow convergence, whereas the retrospective approach can be computationally burdensome. We propose a hybrid algorithm that combines aspects of both approaches to mitigate these shortcomings.
No takes yet. Share an insight, caveat, or question.
Fu et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: