A new algorithm for stochastic discrete resource allocation optimization. (English) Zbl 0959.91037
Summary: Stochastic discrete resource allocation problems are difficult to solve. In this paper, we propose a new algorithm designed specifically to tackle them. The algorithm combines with the nested partitions method, the ordinal optimization techniques, and an efficient simulation control technique. The resulting hybrid algorithm retains the global perspective of the nested partitions method and the fast convergence properties of the ordinal optimization. Numerical reults demonstrate that the hybrid algorithm can be effectively used for many large-scale stochastic discrete optimization problems.
MSC:
91B32 | Resource and cost allocation (including fair division, apportionment, etc.) |
90C59 | Approximation methods and heuristics in mathematical programming |