IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v217y2012i1p141-148.html
   My bibliography  Save this article

Retrospective optimization of mixed-integer stochastic systems using dynamic simplex linear interpolation

Author

Listed:
  • Wang, Honggang

Abstract

We propose a family of retrospective optimization (RO) algorithms for optimizing stochastic systems with both integer and continuous decision variables. The algorithms are continuous search procedures embedded in a RO framework using dynamic simplex interpolation (RODSI). By decreasing dimensions (corresponding to the continuous variables) of simplex, the retrospective solutions become closer to an optimizer of the objective function. We present convergence results of RODSI algorithms for stochastic “convex” systems. Numerical results show that a simple implementation of RODSI algorithms significantly outperforms some random search algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO).

Suggested Citation

  • Wang, Honggang, 2012. "Retrospective optimization of mixed-integer stochastic systems using dynamic simplex linear interpolation," European Journal of Operational Research, Elsevier, vol. 217(1), pages 141-148.
    • Handle: RePEc:eee:ejores:v:217:y:2012:i:1:p:141-148
    DOI: 10.1016/j.ejor.2011.08.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711007612
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2011.08.020?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. Raghu Pasupathy, 2010. "On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization," Operations Research, INFORMS, vol. 58(4-part-1), pages 889-901, August.
    2. Mahmoud H. Alrefaei & Sigrún Andradóttir, 1999. "A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization," Management Science, INFORMS, vol. 45(5), pages 748-764, May.
    3. Seong-Hee Kim & Barry L. Nelson, 2006. "On the Asymptotic Validity of Fully Sequential Selection Procedures for Steady-State Simulation," Operations Research, INFORMS, vol. 54(3), pages 475-488, June.
    4. Frank J. Matejcik & Barry L. Nelson, 1995. "Two-Stage Multiple Comparisons with the Best for Computer Simulation," Operations Research, INFORMS, vol. 43(4), pages 633-640, August.
    5. L. Jeff Hong & Barry L. Nelson, 2006. "Discrete Optimization via Simulation Using COMPASS," Operations Research, INFORMS, vol. 54(1), pages 115-129, February.
    6. Alrefaei, Mahmoud H. & Andradottir, Sigrun, 2001. "A modification of the stochastic ruler method for discrete stochastic optimization," European Journal of Operational Research, Elsevier, vol. 133(1), pages 160-182, August.
    7. A. Shapiro & Y. Wardi, 1996. "Convergence Analysis of Stochastic Algorithms," Mathematics of Operations Research, INFORMS, vol. 21(3), pages 615-628, August.
    8. Sigrún Andradóttir & Andrei A. Prudius, 2009. "Balanced Explorative and Exploitative Search with Estimation for Simulation Optimization," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 193-208, May.
    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. Honggang Wang, 2017. "Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(4), pages 305-322, June.
    2. Wang, Honggang, 2017. "Multi-objective retrospective optimization using stochastic zigzag search," European Journal of Operational Research, Elsevier, vol. 263(3), pages 946-960.

    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. Liujia Hu & Sigrún Andradóttir, 2019. "An Asymptotically Optimal Set Approach for Simulation Optimization," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 21-39, February.
    2. Andrei A. Prudius & Sigrún Andradóttir, 2012. "Averaging frameworks for simulation optimization with applications to simulated annealing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(6), pages 411-429, September.
    3. Chuljin Park & Seong-Hee Kim, 2015. "Penalty Function with Memory for Discrete Optimization via Simulation with Stochastic Constraints," Operations Research, INFORMS, vol. 63(5), pages 1195-1212, October.
    4. Sigrún Andradóttir & Andrei A. Prudius, 2009. "Balanced Explorative and Exploitative Search with Estimation for Simulation Optimization," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 193-208, May.
    5. Jie Xu & Barry L. Nelson & L. Jeff Hong, 2013. "An Adaptive Hyperbox Algorithm for High-Dimensional Discrete Optimization via Simulation Problems," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 133-146, February.
    6. Lihua Sun & L. Jeff Hong & Zhaolin Hu, 2014. "Balancing Exploitation and Exploration in Discrete Optimization via Simulation Through a Gaussian Process-Based Search," Operations Research, INFORMS, vol. 62(6), pages 1416-1438, December.
    7. 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.
    8. Deniz Preil & Michael Krapp, 2023. "Genetic multi-armed bandits: a reinforcement learning approach for discrete optimization via simulation," Papers 2302.07695, arXiv.org.
    9. Güzin Bayraksan & David P. Morton, 2011. "A Sequential Sampling Procedure for Stochastic Programming," Operations Research, INFORMS, vol. 59(4), pages 898-913, August.
    10. Tahir Ekin & Stephen Walker & Paul Damien, 2023. "Augmented simulation methods for discrete stochastic optimization with recourse," Annals of Operations Research, Springer, vol. 320(2), pages 771-793, January.
    11. Shamsuddin Ahmed, 2013. "Performance of derivative free search ANN training algorithm with time series and classification problems," Computational Statistics, Springer, vol. 28(5), pages 1881-1914, October.
    12. Pichitlamken, Juta & Nelson, Barry L. & Hong, L. Jeff, 2006. "A sequential procedure for neighborhood selection-of-the-best in optimization via simulation," European Journal of Operational Research, Elsevier, vol. 173(1), pages 283-298, August.
    13. L. Jeff Hong & Barry L. Nelson, 2006. "Discrete Optimization via Simulation Using COMPASS," Operations Research, INFORMS, vol. 54(1), pages 115-129, February.
    14. Satyajith Amaran & Nikolaos V. Sahinidis & Bikram Sharda & Scott J. Bury, 2016. "Simulation optimization: a review of algorithms and applications," Annals of Operations Research, Springer, vol. 240(1), pages 351-380, May.
    15. Nataša Krejić & Nataša Krklec Jerinkić, 2019. "Spectral projected gradient method for stochastic optimization," Journal of Global Optimization, Springer, vol. 73(1), pages 59-81, January.
    16. Alrefaei, Mahmoud H. & Alawneh, Ameen J., 2004. "Selecting the best stochastic system for large scale problems in DEDS," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 64(2), pages 237-245.
    17. Alrefaei, Mahmoud H. & Alawneh, Ameen J., 2005. "Solution quality of random search methods for discrete stochastic optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 68(2), pages 115-125.
    18. Johannes Royset, 2013. "On sample size control in sample average approximations for solving smooth stochastic programs," Computational Optimization and Applications, Springer, vol. 55(2), pages 265-309, June.
    19. Honggang Wang, 2017. "Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(4), pages 305-322, June.
    20. Kyle Cooper & Susan R. Hunter & Kalyani Nagaraj, 2020. "Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1080-1100, October.

    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:eee:ejores:v:217:y:2012:i:1:p:141-148. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.