A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
From MaRDI portal
Publication:2491793
DOI10.1016/j.ejor.2004.12.010zbMath1125.90395OpenAlexW2074229709MaRDI QIDQ2491793
L. Jeff Hong, Barry L. Nelson, Juta Pichitlamken
Publication date: 29 May 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.12.010
Applications of statistics to economics (62P20) Nonlinear programming (90C30) Stochastic programming (90C15)
Related Items (16)
Control-variate methods for comparison with a standard ⋮ Applying ranking and selection procedures to long-term mitigation for improved network restoration ⋮ Rapid screening algorithms for stochastically constrained problems ⋮ Selection of the best minimal repair systems for Weibull lifetime distribution: A Bayesian approach ⋮ Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures ⋮ Stochastic dominance based comparison for system selection ⋮ On the probability of correct selection in ordinal comparison over dynamic networks ⋮ Indifference-Zone-Free Selection of the Best ⋮ Efficient Ranking and Selection in Parallel Computing Environments ⋮ Selecting the best simulated system with weighted control-variate estimators ⋮ Controlled multistage selection procedures for comparison with a standard ⋮ Fully sequential procedures for comparing constrained systems via simulation ⋮ Selection Procedures for Simulations with Multiple Constraints under Independent and Correlated Sampling ⋮ Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments ⋮ SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications ⋮ A quantile-based approach to system selection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tabu search when noise is present: An illustration in the context of cause and effect analysis
- Note on Anderson's sequential procedures with triangular boundary
- Feature Article: Optimization for simulation: Theory vs. Practice
- A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization
- A procedure for selecting a subset of size m containing the l best of k independent normal populations, with applications to simulation
- A comparison of the performances of procedures for selecting the normal population having the largest mean when the populations have a common unknown variance
- Nested Partitions Method for Global Optimization
- A fully sequential procedure for indifference-zone selection in simulation
- Discrete-event simulation optimization using ranking, selection, and multiple comparison procedures
- A combined procedure for optimization via simulation
- Accelerating the convergence of random search methods for discrete stochastic optimization
- An improvement on paulson's procedure for selecting the poprlation with the largest mean from k normal populations with a common unknown variance
- An improvement on paulson s sequential ranking procedure
- A Sequential Procedure for Selecting the Population with the Largest Mean from $k$ Normal Populations
- Nested partitions method for stochastic optimization
- A modification of the stochastic ruler method for discrete stochastic optimization
This page was built for publication: A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
