A fully sequential procedure for indifference-zone selection in simulation
From MaRDI portal
Recommendations
- An empirical evaluation of several methods to select the best system
- Fully sequential indifference‐zone selection procedures with variance‐dependent sampling
- Using Common Random Numbers for Indifference-Zone Selection and Multiple Comparisons in Simulation
- Indifference-Zone-Free Selection of the Best
- Using Ranking and Selection to “Clean Up” after Simulation Optimization
Cited in
(82)- A multi-objective selection procedure of determining a Pareto set
- A quantile-based approach to system selection
- Simulation optimization for an emergency department healthcare unit in Kuwait
- Selecting the best stochastic system for large scale problems in DEDS.
- Simulation budget allocation for simultaneously selecting the best and worst subsets
- An efficient simulation procedure for ranking the top simulated designs in the presence of stochastic constraints
- Sequential selection procedures: using sample means to improve efficiency
- Stochastic dominance based comparison for system selection
- Considering sample means in Rinott's procedure with a Bayesian approach
- Pareto set estimation with guaranteed probability of correct selection
- Efficient estimation of a risk measure requiring two-stage simulation optimization
- Optimal budget allocation policy for tabu search in stochastic simulation optimization
- Controlled multistage selection procedures for comparison with a standard
- Efficient simulation budget allocation for subset selection using regression metamodels
- A simulation optimization approach for a two-echelon inventory system with service level constraints
- Rapid screening algorithms for stochastically constrained problems
- Robust ranking and selection with optimal computing budget allocation
- A computational method for ranking \(L\)-products of parameters
- A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
- A general framework on the simulation-based optimization under fixed computing budget
- Asymptotic efficiency analysis on the modified Paulson's procedure with a PAC guarantee
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Three-stage selection approach with the initial simulation sample size
- A fully sequential elimination procedure for indifference-zone ranking and selection with tight bounds on probability of correct selection
- Indifference-Zone-Free Selection of the Best
- Selecting a selection procedure
- A simulation-based decision support system for a multi-echelon inventory problem with service level constraints
- On the Asymptotic Validity of Fully Sequential Selection Procedures for Steady-State Simulation
- Applying ranking and selection procedures to long-term mitigation for improved network restoration
- Sequential selection with unknown correlation structures
- Chance constrained selection of the best
- Fully sequential procedures for comparing constrained systems via simulation
- Using Ranking and Selection to “Clean Up” after Simulation Optimization
- Some insights of using common random numbers in selection procedures
- A Simulation Analysis for Ranking and Selecting the Best Combination of Production and Accounting Control Systems
- Finding probably best systems quickly via simulations
- An empirical evaluation of several methods to select the best system
- A new budget allocation framework for the expected opportunity cost
- Efficient ranking and selection in parallel computing environments
- Anticipation in dynamic vehicle routing
- Using Common Random Numbers for Indifference-Zone Selection and Multiple Comparisons in Simulation
- The local time method for targeting and selection
- Gaussian Markov random fields for discrete optimization via simulation: framework and algorithms
- Nonasymptotic sequential tests for overlapping hypotheses applied to near-optimal arm identification in bandit models
- Selecting the best alternative based on its quantile
- Knockout-tournament procedures for large-scale ranking and selection in parallel computing environments
- Solving Large-Scale Fixed-Budget Ranking and Selection Problems
- Finding Feasible Systems for Subjective Constraints Using Recycled Observations
- Selection of the best minimal repair systems for Weibull lifetime distribution: A Bayesian approach
- Ranking and Selection with Covariates for Personalized Decision Making
- Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination
- Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing
- Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures
- Selecting the Best Simulated System: Thinking Differently About an Old Problem
- Tractable sampling strategies for ordinal optimization
- Methods for system selection based on sequential mean-variance analysis
- Algorithm for Calculating the Initial Sample Size in a Fully Sequential Ranking and Selection Procedure
- Selection procedures for simulations with multiple constraints under independent and correlated sampling
- Complete expected improvement converges to an optimal budget allocation
- Fully sequential indifference‐zone selection procedures with variance‐dependent sampling
- An efficient simulation procedure for the expected opportunity cost using metamodels
- Ranking and selection for pairwise comparison
- Sequential selection for accelerated life testing via approximate Bayesian inference
- On the finite-sample statistical validity of adaptive fully sequential procedures
- Asymptotic optimality of myopic ranking and selection procedures
- Convergence rate analysis for optimal computing budget allocation algorithms
- Framework for robust design optimization of tuned mass dampers by stochastic subset optimization
- Pruning inferior systems using subjective constraints with sequentially added thresholds
- Using cache or credit for parallel ranking and selection
- Predicting the simulation budget in ranking and selection procedures
- Optimal computing budget allocation for selecting the optimal subset of multi-objective simulation optimization problems
- Selection of the best in the presence of subjective stochastic constraints
- Data-driven ranking and selection with simultaneous input data collection and simulation
- Knowledge gradient procedure to select the best system under pairwise comparisons
- Review of large-scale simulation optimization
- A budget-adaptive allocation rule for optimal computing budget allocation
- Bi-objective ranking and selection using stochastic kriging
- Dealing with unknown variances in best-arm identification
- Self-adjusting the tolerance level in a fully sequential feasibility check procedure
- Chance-constrained selection of the best: an indifference-zone-free procedure
- Efficient subset selection for the expected opportunity cost
- A Bayesian approach to paired comparison rankings based on a graphical model
This page was built for publication: A fully sequential procedure for indifference-zone selection in simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564810)
