Robust ranking and selection with optimal computing budget allocation

Siyang Gao, Hui Xiao, Enlu Zhou, Weiwei Chen

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

Abstract

In this paper, we consider the ranking and selection (R&S) problem with input uncertainty. It seeks to maximize the probability of correct selection (PCS) for the best design under a fixed simulation budget, where each design is measured by their worst-case performance. To simplify the complexity of PCS, we develop an approximated probability measure and derive an asymptotically optimal solution of the resulting problem. An efficient selection procedure is then designed within the optimal computing budget allocation (OCBA) framework. More importantly, we provide some useful insights on characterizing an efficient robust selection rule and how it can be achieved by adjusting the simulation budgets allocated to each scenario.

Original languageEnglish (US)
Pages (from-to)30-36
Number of pages7
JournalAutomatica
Volume81
DOIs
StatePublished - Jul 1 2017

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Keywords

  • Computing budget allocation
  • OCBA
  • Ranking and selection
  • Robust optimization
  • Simulation optimization

Fingerprint

Dive into the research topics of 'Robust ranking and selection with optimal computing budget allocation'. Together they form a unique fingerprint.

Cite this