Entity

Time filter

Source Type


Yucesan E.,Technology and Operations Management Area
IIE Transactions (Institute of Industrial Engineers) | Year: 2015

Breakthrough innovation has two key prerequisites: idea generation, collection of a large number of competing designs, and idea screening, efficient evaluation, and ranking of these designs to identify the best one(s). Open innovation has recently been modeled and analyzed as innovation contests, where many individuals or teams submit designs or prototypes to an innovating firm. Innovation tournaments increase the capacity of idea generation by enabling access to a broad pool of solvers while avoiding exorbitant costs. To deliver on their promise, however, such tournaments must be designed to enable effective screening of proposed ideas. In particular, given the large number of designs to be evaluated, tournaments must be efficient, favoring quick judgments based on imperfect information over extensive data collection. Through a simulation study, this article shows that contests may not necessarily be the best process for ranking innovation opportunities and selecting the best ones in an efficient way. Instead, we propose a ranking and selection approach that is based on ordinal optimization, which provides both efficiency and accuracy by dynamically allocating evaluation effort away from inferior designs onto promising ones.Anumerical example quantifies the benefits. The proposed approach should therefore complement innovation tournaments' ability of idea generation with efficient idea screening. © 2013 "IIE". Source


Xie J.,Credibly | Frazier P.I.,Cornell University | Chick S.E.,Technology and Operations Management Area
Operations Research | Year: 2016

This paper addresses discrete optimization via simulation. We show that allowing for both a correlated prior distribution on the means (e.g., with discrete Kriging models) and sampling correlation (e.g., with common random numbers, or CRN) can significantly improve the ability to quickly identify the best alternative. These two correlations are brought together for the first time in a highly sequential knowledge-gradient sampling algorithm, which chooses points to sample using a Bayesian value of information (VOI) criterion. We provide almost sure convergence guarantees as the number of samples grows without bound when parameters are known and provide approximations that allow practical implementation including a novel use of the VOI's gradient rather than the response surface's gradient. We demonstrate that CRN leads to improved optimization performance for VOI-based algorithms in sequential sampling environments with a combinatorial number of alternatives and costly samples. © 2016 INFORMS. Source


Yoo T.,Pohang University of Science and Technology | Cho H.,Pohang University of Science and Technology | Yucesan E.,Technology and Operations Management Area
Expert Systems with Applications | Year: 2010

Supply chain optimization, as a key determinant of strategic resources mobility along the value-added chain, allows each participant in the global network to capitalize on its particular strategic competency. Simulation is widely used to test the impact on supply chain performance for the strategic level decisions, such as the number of plants, the modes of transport, or the relocation of warehouses. However, the complexity of supply chain optimization problem and the stochastic nature of simulation cause the unaffordable computational load; the evaluation of a large number of alternatives for supply chain optimization is in a class of NP-hard problem and the number of simulation replications is required for accurately evaluating the performance of each alternative. The objective of the present work is to propose hybrid algorithm with the application of the nested partitioning (NP) method and the optimal computing budget allocation (OCBA) method to reduce the computational load, hence, to improve the efficiency of supply chain optimization via discrete event simulation. The NP method is a global sampling strategy that is continuously adapted via a partitioning of the feasible solution region. The number of candidate alternatives to be evaluated can be reduced by the application of NP. The OCBA method minimizes the number of samples (simulation replications) required to evaluate a particular alternative by allocating computing resources to potentially critical alternative. Carefully designed experiments show extensive numerical result to illustrate the benefits of the proposed approach. © 2009 Elsevier Ltd. All rights reserved. Source


Frazier P.I.,Cornell University | Xie J.,Cornell University | Chick S.E.,Technology and Operations Management Area
Proceedings - Winter Simulation Conference | Year: 2011

We consider optimization via simulation over a finite set of alternatives. We employ a Bayesian value-of-information approach in which we allow both correlated prior beliefs on the sampling means and correlated sampling. Correlation in the prior belief allow us to learn about an alternative's value from samples of similar alternatives. Correlation in sampling, achieved through common random numbers, allows us to reduce the variance in comparing one alternative to another. We allow for a more general combination of both types of correlation than has been offered previously in the Bayesian ranking and selection literature. We do so by giving an exact expression for the value of information for sampling the difference between a pair of alternatives, and derive new knowledge-gradient methods based on this valuation. © 2011 IEEE. Source


Pasupathy R.,Virginia Polytechnic Institute and State University | Szechtman R.,Naval Postgraduate School, Monterey | Yucesan E.,Technology and Operations Management Area
Proceedings - Winter Simulation Conference | Year: 2010

Ranking and selection (R&S) techniques are statistical methods developed to select the best system, or a subset of systems from among a set of alternative system designs. R&S via simulation is particularly appealing as it combines modeling flexibility of simulation with the efficiency of statistical techniques for effective decision making. The overwhelming majority of the R&S research, however, focuses on the expected performance of competing designs. Alternatively, quantiles, which provide additional information about the distribution of the performance measure of interest, may serve as better risk measures than the usual expected value. In stochastic systems, quantiles indicate the level of system performance that can be delivered with a specified probability. In this paper, we address the problem of ranking and selection based on quantiles. In particular, we formulate the problem and characterize the optimal budget allocation scheme using the large deviations theory. ©2010 IEEE. Source

Discover hidden collaborations