A Stochastic Perturbation algorithm for inventory optimization in supply chains

Liya Wang, Vittal Prabhu

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

Abstract

In recent years, simulation optimization has attracted a great deal of attention because simulation can model the real systems in fidelity and capture complex dynamics. Among numerous simulation optimization algorithms, Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm is an attractive approach because of its simplicity and efficiency. Although SPSA has been applied in several problems, it does not converge for some. This research proposes Augmented Simultaneous Perturbation Stochastic Approximation (ASPSA) algorithm in which SPSA is augmented to include presearch, ordinal optimization, non-uniform gain, and line search. Performances of ASPSA are tested on complex discrete supply chain inventory optimization problems. The tests results show that ASPSA not only achieves speed up, but also improves solution quality and converges faster than SPSA. Experiments also show that ASPSA is comparable to Genetic Algorithms in solution quality (6% to 15% worse) but is much more efficient computationally (over 12x faster).

Original languageEnglish (US)
Pages (from-to)1-18
Number of pages18
JournalInternational Journal of Information Systems and Supply Chain Management
Volume2
Issue number3
DOIs
StatePublished - Jul 2009

All Science Journal Classification (ASJC) codes

  • Management Information Systems
  • Information Systems

Fingerprint Dive into the research topics of 'A Stochastic Perturbation algorithm for inventory optimization in supply chains'. Together they form a unique fingerprint.

Cite this