IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v62y2011i1d10.1057_jors.2009.163.html
   My bibliography  Save this article

Robust parameter design optimization of simulation experiments using stochastic perturbation methods

Author

Listed:
  • A K Miranda

    (The Pennsylvania State University)

  • E Del Castillo

    (The Pennsylvania State University)

Abstract

Stochastic perturbation methods can be applied to problems for which either the objective function is represented analytically, or the objective function is the result of a simulation experiment. The Simultaneous Perturbation Stochastic Approximation (SPSA) method has the advantage over similar methods of requiring only two measurements at each iteration of the search. This feature makes SPSA attractive for robust parameter design (RPD) problems where some factors affect the variance of the response(s) of interest. In this paper, the feasibility of SPSA as a RPD optimizer is presented, first when the objective function is known, and then when the objective function is estimated by means of a discrete-event simulation.

Suggested Citation

  • A K Miranda & E Del Castillo, 2011. "Robust parameter design optimization of simulation experiments using stochastic perturbation methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 198-205, January.
  • Handle: RePEc:pal:jorsoc:v:62:y:2011:i:1:d:10.1057_jors.2009.163
    DOI: 10.1057/jors.2009.163
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2009.163
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/jors.2009.163?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J S Yeomans, 2002. "Automatic generation of efficient policy alternatives via simulation-optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(11), pages 1256-1267, November.
    2. Y-C Ho & C G Cassandras & C-H Chen & L Dai, 2000. "Ordinal optimisation and simulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(4), pages 490-500, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gabriella Dellino & Jack P. C. Kleijnen & Carlo Meloni, 2012. "Robust Optimization in Simulation: Taguchi and Krige Combined," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 471-484, August.
    2. Yanikoglu, I. & den Hertog, D. & Kleijnen, Jack P.C., 2013. "Adjustable Robust Parameter Design with Unknown Distributions," Other publications TiSEM 47fec228-1ffe-4803-8e97-5, Tilburg University, School of Economics and Management.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. H. S. Chang, 2004. "Technical Note: On Ordinal Comparison of Policies in Markov Reward Processes," Journal of Optimization Theory and Applications, Springer, vol. 122(1), pages 207-217, July.
    2. Julian Yeomans, 2011. "Efficient generation of alternative perspectives in public environmental policy formulation: applying co-evolutionary simulation–optimization to municipal solid waste management," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 19(4), pages 391-413, December.
    3. L. Jeff Hong & Barry L. Nelson, 2006. "Discrete Optimization via Simulation Using COMPASS," Operations Research, INFORMS, vol. 54(1), pages 115-129, February.
    4. S.Y. Lin & Y.C. Ho, 2002. "Universal Alignment Probability Revisited," Journal of Optimization Theory and Applications, Springer, vol. 113(2), pages 399-407, May.
    5. Shing Chih Tsai & Tse Yang, 2017. "Rapid screening algorithms for stochastically constrained problems," Annals of Operations Research, Springer, vol. 254(1), pages 425-447, July.
    6. Hyeong Soo Chang & Jiaqiao Hu, 2012. "On the Probability of Correct Selection in Ordinal Comparison over Dynamic Networks," Journal of Optimization Theory and Applications, Springer, vol. 155(2), pages 594-604, November.
    7. H. S. Chang, 2005. "On the Probability of Correct Selection by Distributed Voting in Stochastic Optimization," Journal of Optimization Theory and Applications, Springer, vol. 125(1), pages 231-240, April.
    8. Michael C. Fu, 2002. "Feature Article: Optimization for simulation: Theory vs. Practice," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 192-215, August.
    9. Sudip Bhattacharjee & Hong Zhang & R. Ramesh & Dee H. Andrews, 2007. "A Decomposition and Guided Simulation Methodology for Large-Scale System Design: A Study in QoS-Capable Intranets with Fixed and Mobile Components," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 429-442, August.
    10. Shing Chih Tsai, 2013. "Rapid Screening Procedures for Zero-One Optimization via Simulation," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 317-331, May.
    11. Angun, M.E., 2004. "Black box simulation optimization : Generalized response surface methodology," Other publications TiSEM 2548e953-54ce-44e2-8c5b-7, Tilburg University, School of Economics and Management.
    12. Miguel Lejeune & François Margot, 2011. "Optimization for simulation: LAD accelerator," Annals of Operations Research, Springer, vol. 188(1), pages 285-305, August.
    13. Zelda B. Zabinsky & David D. Linz, 2023. "Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise," Journal of Global Optimization, Springer, vol. 87(1), pages 31-55, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:62:y:2011:i:1:d:10.1057_jors.2009.163. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.