IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v56y2024i11p1176-1188.html
   My bibliography  Save this article

Similarity-based sampling for simulation with binary outcomes

Author

Listed:
  • Haitao Liu
  • Ping Cao
  • Loo Hay Lee
  • Ek Peng Chew

Abstract

We consider a feasibility determination problem via simulation with stochastic binary outcomes, in which the design space can be either discrete or continuous, and outcomes can be predicted through a functional relationship that depends on linear combinations of design variables. The goal is to identify all the feasible designs with means (i.e., probabilities) no smaller than a threshold. A logistic model is used to capture the relationship between the probability and design variables. Traditional binary rewards often conceal the numbers of correct and false determinations, thereby being inefficient in large and continuous design spaces. We thus propose a similarity measure to smooth binary rewards. Then, a sampling policy that optimizes a so-called Similarity Differential (SD) is developed. Under some mild conditions, we show that the SD policy is capable of identifying all the feasible designs as the sampling budget goes to infinity. Two approximate versions of the SD policy are developed to sequentially determine the sampling decisions in large and continuous design spaces. Extensive numerical experiments are conducted to demonstrate the superior performance of our SD policy, document computational savings, and reveal underlying sampling behaviors. Alternatively, we provide a simple but effective heuristic that can be easily used by practitioners.

Suggested Citation

  • Haitao Liu & Ping Cao & Loo Hay Lee & Ek Peng Chew, 2024. "Similarity-based sampling for simulation with binary outcomes," IISE Transactions, Taylor & Francis Journals, vol. 56(11), pages 1176-1188, November.
  • Handle: RePEc:taf:uiiexx:v:56:y:2024:i:11:p:1176-1188
    DOI: 10.1080/24725854.2023.2271027
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/24725854.2023.2271027?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:uiiexx:v:56:y:2024:i:11:p:1176-1188. 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/uiie .

    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.