Stochastic discrete optimization
SIAM Journal on Control and Optimization
A method for discrete stochastic optimization
Management Science
Stochastic Comparison Algorithm for Discrete Optimization with Estimation
SIAM Journal on Optimization
Simulation Budget Allocation for Further Enhancing theEfficiency of Ordinal Optimization
Discrete Event Dynamic Systems
New Two-Stage and Sequential Procedures for Selecting the Best Simulated System
Operations Research
Stocking Retail Assortments Under Dynamic Consumer Substitution
Operations Research
Feature Article: Optimization for simulation: Theory vs. Practice
INFORMS Journal on Computing
A combined procedure for optimization via simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Simulation optimization: a review, new developments, and applications
WSC '05 Proceedings of the 37th conference on Winter simulation
Discrete Optimization via Simulation Using COMPASS
Operations Research
A framework for locally convergent random-search algorithms for discrete optimization via simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A Model Reference Adaptive Search Method for Global Optimization
Operations Research
Balanced Explorative and Exploitative Search with Estimation for Simulation Optimization
INFORMS Journal on Computing
Industrial strength COMPASS: A comprehensive algorithm and software for optimization via simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Efficient discrete optimization via simulation using stochastic kriging
Proceedings of the Winter Simulation Conference
Rapid Screening Procedures for Zero-One Optimization via Simulation
INFORMS Journal on Computing
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Hi-index | 0.00 |
We propose an adaptive hyperbox algorithm AHA, which is an instance of a locally convergent, random search algorithm for solving discrete optimization via simulation problems. Compared to the COMPASS algorithm, AHA is more efficient in high-dimensional problems. By analyzing models of the behavior of COMPASS and AHA, we show why COMPASS slows down significantly as dimension increases, whereas AHA is less affected. Both AHA and COMPASS can be used as the local search algorithm within the Industrial Strength COMPASS framework, which consists of a global search phase, a local search phase, and a final cleanup phase. We compare the performance of AHA to COMPASS within the framework of Industrial Strength COMPASS and as stand-alone algorithms. Numerical experiments demonstrate that AHA scales up well in high-dimensional problems and has similar performance to COMPASS in low-dimensional problems.