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 research, 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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Information Systems and Supply Chain Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.