Speeding up COMPASS for high-dimensional discrete optimization via simulation

@article{Hong2010SpeedingUC,
  title={Speeding up COMPASS for high-dimensional discrete optimization via simulation},
  author={L. Jeff Hong and Barry L. Nelson and Jie Xu},
  journal={Oper. Res. Lett.},
  year={2010},
  volume={38},
  pages={550-555}
}
The convergent optimization via most promising area stochastic search (COMPASS) algorithm is a locally convergent randomsearch algorithm for solving discrete optimization via simulation problems. COMPASS has drawn a significant amount of attention since its introduction. While the asymptotic convergence of COMPASS does not depend on the problem dimension, the finite-time performance of the algorithm often deteriorates as the dimension increases. In this paper, we investigate the reasons for… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Supply Chain Resilience: Development of a Conceptual Framework

T. J. Petit
an Assessment Tool and an Implementation Process, Ph.D. Thesis, Ohio State University, Columbus, OH • 2008
View 1 Excerpt

Statistical Physics: An Introduction

D. Yoshioka
Springer, Berlin, Germany • 2007
View 2 Excerpts

Similar Papers

Loading similar papers…