SCORE allocations for bi-objective ranking and selection. Feldman, G. & Hunter, S. R. ACM Transactions on Modeling and Computer Simulation, 28(1):7:1–7:28, January, 2018. ![SCORE allocations for bi-objective ranking and selection [link]](https://bibbase.org/img/filetypes/link.svg "link")
Link ![SCORE allocations for bi-objective ranking and selection [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper doi abstract bibtex The bi-objective ranking and selection (R&S) problem is a special case of the multi-objective simulation optimization problem in which two conflicting objectives are known only through dependent Monte Carlo estimators, the decision space or number of systems is finite, and each system can be sampled to some extent. The solution to the bi-objective R&S problem is a set of systems with non-dominated objective vectors, called the set of Pareto systems. We exploit the special structure of the bi-objective problem to characterize the asymptotically optimal simulation budget allocation, which accounts for dependence between the objectives and balances the probabilities associated with two types of misclassification error. Like much of the R&S literature, our focus is on the case in which the simulation observations are bivariate normal. Assuming normality, we then use a certain asymptotic limit to derive an easily-implementable SCORE (Sampling Criteria for Optimization using Rate Estimators) sampling framework that approximates the optimal allocation and accounts for correlation between the objectives. Perhaps surprisingly, the limiting SCORE allocation exclusively controls for misclassification-by-inclusion events, in which non-Pareto systems are falsely estimated as Pareto. We also provide an iterative algorithm for implementation. Our numerical experience with the resulting SCORE framework indicates that it is fast and accurate for problems having up to ten thousand systems.
@article{2018felhun,
Year = {2018},
Author = {G. Feldman and S. R. Hunter},
Title = {{SCORE} allocations for bi-objective ranking and selection},
journal = {ACM Transactions on Modeling and Computer Simulation},
volume = {28},
number = {1},
month = {January},
articleno = {7},
numpages = {28},
pages = {7:1--7:28},
doi = {10.1145/3158666},
url_Link = {https://dl.acm.org/authorize?N42866},
url_Paper = {http://web.ics.purdue.edu/~hunter63/PAPERS/pre2017felhun.pdf},
abstract = {The bi-objective ranking and selection (R\&S) problem is a special case of the multi-objective simulation optimization problem in which two conflicting objectives are known only through dependent Monte Carlo estimators, the decision space or number of systems is finite, and each system can be sampled to some extent. The solution to the bi-objective R\&S problem is a set of systems with non-dominated objective vectors, called the set of Pareto systems. We exploit the special structure of the bi-objective problem to characterize the asymptotically optimal simulation budget allocation, which accounts for dependence between the objectives and balances the probabilities associated with two types of misclassification error. Like much of the R\&S literature, our focus is on the case in which the simulation observations are bivariate normal. Assuming normality, we then use a certain asymptotic limit to derive an easily-implementable SCORE (Sampling Criteria for Optimization using Rate Estimators) sampling framework that approximates the optimal allocation and accounts for correlation between the objectives. Perhaps surprisingly, the limiting SCORE allocation exclusively controls for misclassification-by-inclusion events, in which non-Pareto systems are falsely estimated as Pareto. We also provide an iterative algorithm for implementation. Our numerical experience with the resulting SCORE framework indicates that it is fast and accurate for problems having up to ten thousand systems.},
keywords = {simulation optimization > multi-objective > ranking and selection}}
Downloads: 0
{"_id":"NsShbE5ZLMYguGL7r","bibbaseid":"feldman-hunter-scoreallocationsforbiobjectiverankingandselection-2018","author_short":["Feldman, G.","Hunter, S. R."],"bibdata":{"bibtype":"article","type":"article","year":"2018","author":[{"firstnames":["G."],"propositions":[],"lastnames":["Feldman"],"suffixes":[]},{"firstnames":["S.","R."],"propositions":[],"lastnames":["Hunter"],"suffixes":[]}],"title":"SCORE allocations for bi-objective ranking and selection","journal":"ACM Transactions on Modeling and Computer Simulation","volume":"28","number":"1","month":"January","articleno":"7","numpages":"28","pages":"7:1–7:28","doi":"10.1145/3158666","url_link":"https://dl.acm.org/authorize?N42866","url_paper":"http://web.ics.purdue.edu/~hunter63/PAPERS/pre2017felhun.pdf","abstract":"The bi-objective ranking and selection (R&S) problem is a special case of the multi-objective simulation optimization problem in which two conflicting objectives are known only through dependent Monte Carlo estimators, the decision space or number of systems is finite, and each system can be sampled to some extent. The solution to the bi-objective R&S problem is a set of systems with non-dominated objective vectors, called the set of Pareto systems. We exploit the special structure of the bi-objective problem to characterize the asymptotically optimal simulation budget allocation, which accounts for dependence between the objectives and balances the probabilities associated with two types of misclassification error. Like much of the R&S literature, our focus is on the case in which the simulation observations are bivariate normal. Assuming normality, we then use a certain asymptotic limit to derive an easily-implementable SCORE (Sampling Criteria for Optimization using Rate Estimators) sampling framework that approximates the optimal allocation and accounts for correlation between the objectives. Perhaps surprisingly, the limiting SCORE allocation exclusively controls for misclassification-by-inclusion events, in which non-Pareto systems are falsely estimated as Pareto. We also provide an iterative algorithm for implementation. Our numerical experience with the resulting SCORE framework indicates that it is fast and accurate for problems having up to ten thousand systems.","keywords":"simulation optimization > multi-objective > ranking and selection","bibtex":"@article{2018felhun,\n\tYear = {2018},\n\tAuthor = {G. Feldman and S. R. Hunter},\n\tTitle = {{SCORE} allocations for bi-objective ranking and selection},\n\tjournal = {ACM Transactions on Modeling and Computer Simulation},\n\tvolume = {28},\n\tnumber = {1},\n\tmonth = {January},\n\tarticleno = {7},\n\tnumpages = {28},\n\tpages = {7:1--7:28},\n\tdoi = {10.1145/3158666},\n\turl_Link = {https://dl.acm.org/authorize?N42866},\n\turl_Paper = {http://web.ics.purdue.edu/~hunter63/PAPERS/pre2017felhun.pdf},\n\tabstract = {The bi-objective ranking and selection (R\\&S) problem is a special case of the multi-objective simulation optimization problem in which two conflicting objectives are known only through dependent Monte Carlo estimators, the decision space or number of systems is finite, and each system can be sampled to some extent. The solution to the bi-objective R\\&S problem is a set of systems with non-dominated objective vectors, called the set of Pareto systems. We exploit the special structure of the bi-objective problem to characterize the asymptotically optimal simulation budget allocation, which accounts for dependence between the objectives and balances the probabilities associated with two types of misclassification error. Like much of the R\\&S literature, our focus is on the case in which the simulation observations are bivariate normal. Assuming normality, we then use a certain asymptotic limit to derive an easily-implementable SCORE (Sampling Criteria for Optimization using Rate Estimators) sampling framework that approximates the optimal allocation and accounts for correlation between the objectives. Perhaps surprisingly, the limiting SCORE allocation exclusively controls for misclassification-by-inclusion events, in which non-Pareto systems are falsely estimated as Pareto. We also provide an iterative algorithm for implementation. Our numerical experience with the resulting SCORE framework indicates that it is fast and accurate for problems having up to ten thousand systems.},\n\tkeywords = {simulation optimization > multi-objective > ranking and selection}}\n\n","author_short":["Feldman, G.","Hunter, S. R."],"key":"2018felhun","id":"2018felhun","bibbaseid":"feldman-hunter-scoreallocationsforbiobjectiverankingandselection-2018","role":"author","urls":{" link":"https://dl.acm.org/authorize?N42866"," paper":"http://web.ics.purdue.edu/~hunter63/PAPERS/pre2017felhun.pdf"},"keyword":["simulation optimization > multi-objective > ranking and selection"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://web.ics.purdue.edu/~hunter63/PAPERS/srhunterweb.bib","dataSources":["PkcXzWbdqPvM6bmCx","ZEwmdExPMCtzAbo22"],"keywords":["simulation optimization > multi-objective > ranking and selection"],"search_terms":["score","allocations","objective","ranking","selection","feldman","hunter"],"title":"SCORE allocations for bi-objective ranking and selection","year":2018}