Rapid screening procedures for zero-one optimization via simulation

研究成果: Article同行評審

6 引文 斯高帕斯(Scopus)

摘要

Some existing simulation optimization algorithms (e.g., adaptive random search) become pure random search methods and thus are ineffective for the zero-one optimization via simulation problem. In this paper, we present highly efficient rapid screening procedures for solving the zero-one optimization via simulation problem. Three approaches adopting different sampling rules and providing different statistical guarantees are described. We also propose efficient neighborhood search methods and a simple algorithm for generation of initial solutions, all of which can be incorporated into our rapid screening procedures. The proposed procedures are more adaptive than ordinary ranking and selection procedures because in each iteration they can eliminate inferior solutions and intelligently sample promising solutions from the neighborhood of the survivors. Empirical studies are performed to compare the efficiency of the proposed procedures with other existing ones.

原文English
頁(從 - 到)317-331
頁數15
期刊INFORMS Journal on Computing
25
發行號2
DOIs
出版狀態Published - 2013 三月 1

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Computer Science Applications
  • Management Science and Operations Research

指紋 深入研究「Rapid screening procedures for zero-one optimization via simulation」主題。共同形成了獨特的指紋。

引用此