This technical note considers the problem of selecting the top-m designs using simulation with input uncertainty. The performance of each design is measured by its worst-case performance. The objective of this research is to maximize the probability of correctly selecting the top-m designs given a fixed simulation budget. Due to the complexity of probability of correct selection (PCS), we develop a lower bound for the PCS and derive an asymptotically optimal budget allocation rule. Useful insights on characterizing the efficient budget allocation rule with input uncertainty are provided. Meanwhile, a sequential simulation procedure is suggested to implement the allocation rule. A series of numerical experiments indicate that the proposed simulation budget allocation rule can outperform all existing selection rules.
Partition-based random search (PRS) provides a class of effective algorithms for global optimization. In each iteration of a PRS algorithm, the solution space is partitioned into subsets which are randomly sampled and evaluated. One subset is then determined to be the promising subset for further partitioning. In this paper, we propose the problem of allocating samples to each subset so that the samples are utilized most efficiently. Two types of sample allocation problems are discussed, with objectives of maximizing the probability of correctly selecting the promising subset (P{CSPS}) given a sample budget and minimizing the required sample size to achieve a satisfied level of P{CSPS}, respectively. An extreme value-based prospectiveness criterion is introduced and an asymptotically optimal solution to the two types of sample allocation problems is developed. The resulting optimal sample allocation strategy (OSAS) is an effective procedure for the existing PRS algorithms by intelligently utilizing the limited computing resources. Numerical tests confirm that OSAS is capable of increasing the P{CSPS} in each iteration and subsequently improving the performance of PRS algorithms.
In this article, the problem of selecting an optimal subset from a finite set of simulated designs is considered. Given the total simulation budget constraint, the selection problem aims to maximize the Probability of Correct Selection (PCS) of the top m designs. To simplify the complexity of the PCS, an approximated probability measure is developed and an asymptotically optimal solution of the resulting problem is derived. A subset selection procedure, which is easy to implement in practice, is then designed. More important, we provide some useful insights on characterizing an efficient subset selection rule and how it can be achieved by adjusting the simulation budgets allocated to all of the designs.
1 January 2024 in Manufacturing & Service Operations Management
Problem definition: Personalized medicine (PM) seeks the best treatment for each patient among a set of available treatment methods. Because a specific treatment does not work well on all patients, traditionally, the best treatment was selected based on the doctor’s personal experience and expertise, which is subject to human errors. In the meantime, stochastic models have been well developed in the literature for a lot of major diseases. This gives rise to a simulation-based solution for PM, which uses the simulation tool to evaluate the performance for pairs of treatment and patient biometric characteristics and, based on that, selects the best treatment for each patient characteristic. Methodology/results: In this research, we extend the ranking and selection (R&S) model in simulation-based decision making to solving PM. The biometric characteristics of a patient are treated as a context for R&S, and we call it contextual ranking and selection (CR&S). We consider two formulations of CR&S with small and large context spaces, respectively, and develop new techniques for solving them and identifying the rate-optimal budget allocation rules. Based on them, two selection algorithms are proposed, which can be shown to be numerically superior via a set of tests on abstract and real-world examples. Managerial implications: This research provides a systematic way of conducting simulation-based decision-making for PM. To improve the overall decision quality for the possible contexts, more simulation efforts should be devoted to contexts in which it is difficult to distinguish between the best treatment and non-best treatments, and our results quantify the optimal trade-off of the simulation efforts between the pairs of contexts and treatments. Funding: J. Du is partially supported by the National Natural Science Foundation of China [Grant 72091211]. C.-H. Chen is partially supported by the National Science Foundation under Awards FAIN212368. Supplemental Material: The e-companion is available at https://doi.org/10.1287/msom.2022.0232 .
There are multiple modes for human immunodeficiency virus (HIV) transmissions, each of which is usually associated with a certain key population (e.g., needle sharing among people who inject drugs). Recent field studies revealed the merging trend of multiple key populations, making HIV intervention difficult because of the existence of multiple transmission modes in such complex multiplex social networks. In this paper, we aim to address this challenge by developing a multiplex social network framework to capture the multimode transmission across two key populations. Based on the multiplex social network framework, we propose a new random search method, named partition-based random search with network and memory prioritization (PRS-NMP), to identify the optimal subset of high-value individuals in the social network for interventions. Numerical experiments demonstrated that the proposed PRS-NMP-based interventions could effectively reduce the scale of HIV transmissions. The performance of PRS-NMP-based interventions is consistently better than the benchmark nested partitions method and network-based metrics.