Efficient selection of a set of good enough designs with complexity preference

Yan, Shen

Permalink

https://hdl.handle.net/2142/26270 Copy

Description

Title

Efficient selection of a set of good enough designs with complexity preference

Author(s)

Yan, Shen

Issue Date

2011-08-26T15:20:38Z

Director of Research (if dissertation) or Advisor (if thesis)

Zhou, Enlu

Department of Study

Industrial&Enterprise Sys Eng

Discipline

Industrial Engineering

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

M.S.

Degree Level

Thesis

Keyword(s)

• discrete-event system simulation
• best design selection problem
• Optimal Computing Budget Allocation

Abstract

This thesis briefly reviews the important methods involved in solving the best design selection problem in the discrete-event system simulation. The selection of one or several best designs is a common problem people meet in real situations. The research originally focused on the one best design selection problem, the two-stage procedure. Later, there was literature about multiple designs selection problems which are useful in the global optimization as well. Most recently, some researchers have studied the problem of selecting one simplest sufficiently good design applicable to the node activation rule in the wireless sensor networks. However, the problem for selecting several simplest good enough designs is still open for consideration. The second part of the thesis introduces two new algorithms for solving the selection problem related to the designs mentioned above. These two algorithms OCBA-mSG and OCBA-bSG allocate the simulation budget efficiently to identify a subset of m simplest and good enough designs among a total of K (K > m) designs. The numerical results show that both OCBA-mSG and OCBA-bSG outperform some other approaches on the test problems.

Graduation Semester

2011-08

Permalink

http://hdl.handle.net/2142/26270

Copyright and License Information

Copyright 2011 Shen Yan

Owning Collections