Logo image
A hybrid search algorithm with optimal computing budget allocation for resource allocation problem
Conference paper

A hybrid search algorithm with optimal computing budget allocation for resource allocation problem

James T. Lin and Chun-Chih Chiu.
WSC '13 Proceedings of the 2013 Winter Simulation Conference WSC '13 Proceedings of the 2013 Winter Simulation Conference, pp.4006-4007
2013

Abstract

In this paper, a simulation-based optimization approach, named NHOCBA, for a typical resource allocation problem is presented. The hybrid algorithm based on neighborhood algorithm is applied to explore toward optimal direction in design space. For increasing efficiency, an optimal computing budget allocation (OCBA) is adopted to compute the optimal number of replications and to provide reliable evaluation of variance. In addition, we deal with the resource allocation problem which exist multiple global optima in design space. Therefore, a trim procedure which prevents to allocate extra numbers of replication to local optima has been proposed to enhance efficiency. Then, we use confidence interval at the end of algorithm procedure to find an optimal set instead of an optimal solution from design space. Finally, we compare the NHOCBA with different algorithms by experimentation study which shows that NHOCBA approach can perform better than the other algorithms under certain conditions.

Metrics

1 Record Views

Details

Logo image