A Stochastic Perturbation Algorithm for Inventory Optimization in Supply Chains

View Sample PDF

Author(s): Liya Wang (NASA Ames Research Park, USA)and Vittal Prabhu (Penn State University, USA)
Copyright: 2011
Pages: 16
Source title: Supply Chain Optimization, Management and Integration: Emerging Applications
Source Author(s)/Editor(s): John Wang (Montclair State University, USA)
DOI: 10.4018/978-1-60960-135-5.ch012

Keywords: Business & Management / Business Science Reference / Operations and Service Management / Supply Chain Management

Purchase

View A Stochastic Perturbation Algorithm for Inventory Optimization in Supply Chains on the publisher's website for pricing and purchasing information.

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).

The IRMA Community

Research IRM

A Stochastic Perturbation Algorithm for Inventory Optimization in Supply Chains

Purchase

Abstract

Related Content

IRMA Sponsors