IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v75y2024i9p1711-1725.html
   My bibliography  Save this article

An efficient simulation optimization method for the redundancy allocation problem with a chance constraint

Author

Listed:
  • Kuo-Hao Chang
  • Chi-Ping Lin

Abstract

We explore the Redundancy Allocation Problem (RAP) under the objective of minimizing the cost of a production system of general topology in which system reliability is treated as a chance constraint. A novel simulation optimization-based solution method grounded in the concepts of the trust region and response surface methodology is proposed to efficiently solve the generalized RAP (GRAP) under random system survival times. The generalizability of the RAP model and efficiency of the solution method allows for our approach to be utilized in a wide variety of real-world applications. We demonstrate in a series of numerical experiments based on production systems of varying complexity that the finite convergence of the proposed method is much more efficient than the commonly-used genetic algorithm. It is shown that on a simple bridge network, only the proposed algorithm can find the true optimal solution to the GRAP under an allotted computational budget. On a complex network which includes series, parallel, and logical relationships, the proposed algorithm is also shown to find solutions to the GRAP which have substantially lower total system cost than those found by GA under a wide variety of scenarios.

Suggested Citation

  • Kuo-Hao Chang & Chi-Ping Lin, 2024. "An efficient simulation optimization method for the redundancy allocation problem with a chance constraint," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(9), pages 1711-1725, September.
  • Handle: RePEc:taf:tjorxx:v:75:y:2024:i:9:p:1711-1725
    DOI: 10.1080/01605682.2023.2272860
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2023.2272860
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2023.2272860?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:75:y:2024:i:9:p:1711-1725. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.