Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"OCBA"”.

  1. OPTIMAL COMPUTING BUDGET ALLOCATION FOR SIMULATION BASED OPTIMIZATION AND COMPLEX DECISION MAKING

    Optimal Computing Budget Allocation (OCBA) considers the problem how to get a best result based on the simulation output under a computing budget constraint. It is not only an efficient ranking and selection procedure for simulation problems with finite candidate solutions but also an attractive …

    nus Repository record for OPTIMAL COMPUTING BUDGET ALLOCATION FOR SIMULATION BASED OPTIMIZATION AND COMPLEX DECISION MAKING (opens in a new tab)

  2. Efficient selection of a set of good enough designs with complexity preference

    … designs mentioned above. These two algorithms OCBA-mSG and OCBA-bSG allocate the simulation budget efficiently to identify a subset of m simplest and good enough designs among a total of K (K > m) designs. The numerical results show that both OCBA-mSG and OCBA-bSG outperform some other …

    uiuc Repository record for Efficient selection of a set of good enough designs with complexity preference (opens in a new tab)

  3. Using metaheuristics with the ranking and selection indifference-zone procedure MMY in problems with many objectives

    … IZ and optimal computing budget allocation (OCBA) methods within the broader context of multi-objective simulation optimisation (MOSO). Although OCBA-based MORS approaches have been integrated with metaheuristics, the literature reveals a gap in similar work involving IZ-based methods like …

    stellenbosch Repository record for Using metaheuristics with the ranking and selection indifference-zone procedure MMY in problems with many objectives (opens in a new tab)

  4. New model-based methods for non-differentiable optimization

    … with optimal computing budget allocation (CE-OCBA).

    uiuc Repository record for New model-based methods for non-differentiable optimization (opens in a new tab)