The methodology based on computing budget allocation is an effective tool in solving the problem of selecting the best design out of a group of stochastic systems via simulation. It can intelligently determine the best simulation lengths for all simulation experiment and thus significantly reduce the total computation cost to obtain the same confidence level. After a comprehensive review of previous works, this dissertation extends the previous efforts to investigate improved technologies which provided very different view of how to efficiently allocate the computing budget. Not only can the new approaches fix some unsolved difficulty in the previous works, but also improve the speed of the earlier approaches. Moreover, comparing with other...
Constrained ranking and selection (R&S) refers to the problem of selecting the best feasible des...
In this paper, we develop an optimal computing budget allocation (OCBA) algorithm for selecting a su...
Simulation is widely used to identify the best of a finite set of proposed systems, where 'best' is ...
We consider a class of the subset selection problem in ranking and selection. The objective is to id...
We present a simulation run allocation scheme for improving efficiency in simulation experiments for...
Discrete-event systems (DES) simulation is a popular tool for analyzing systems and evaluating decis...
Selecting a subset of the best solutions among large-scale problems is an important area of research...
10.1109/CoASE.2012.6386330IEEE International Conference on Automation Science and Engineering230-23
This paper proposes a bound-based simulation budget allocation (BSBA) procedure for solving ranking ...
This article investigates a budget allocation problem for optimally running stochastic simulation mo...
Statistical selection procedures are used to select the best simulated system from a finite set of a...
Ordinal Optimization has emerged as an efficient technique for simulation and optimization. Exponent...
Tabu search (TS) is a powerful method for solving combinatorial optimization problems. However, when...
We consider the problem of allocating a given simulation budget among a set of design alternatives i...
In this paper, a simulation-based optimization approach, named NHOCBA, for a typical resource alloca...
Constrained ranking and selection (R&S) refers to the problem of selecting the best feasible des...
In this paper, we develop an optimal computing budget allocation (OCBA) algorithm for selecting a su...
Simulation is widely used to identify the best of a finite set of proposed systems, where 'best' is ...
We consider a class of the subset selection problem in ranking and selection. The objective is to id...
We present a simulation run allocation scheme for improving efficiency in simulation experiments for...
Discrete-event systems (DES) simulation is a popular tool for analyzing systems and evaluating decis...
Selecting a subset of the best solutions among large-scale problems is an important area of research...
10.1109/CoASE.2012.6386330IEEE International Conference on Automation Science and Engineering230-23
This paper proposes a bound-based simulation budget allocation (BSBA) procedure for solving ranking ...
This article investigates a budget allocation problem for optimally running stochastic simulation mo...
Statistical selection procedures are used to select the best simulated system from a finite set of a...
Ordinal Optimization has emerged as an efficient technique for simulation and optimization. Exponent...
Tabu search (TS) is a powerful method for solving combinatorial optimization problems. However, when...
We consider the problem of allocating a given simulation budget among a set of design alternatives i...
In this paper, a simulation-based optimization approach, named NHOCBA, for a typical resource alloca...
Constrained ranking and selection (R&S) refers to the problem of selecting the best feasible des...
In this paper, we develop an optimal computing budget allocation (OCBA) algorithm for selecting a su...
Simulation is widely used to identify the best of a finite set of proposed systems, where 'best' is ...