The optimizing-simulator: merging simulation and optimization using approximate dynamic programming
WSC '05 Proceedings of the 37th conference on Winter simulation
The Dynamic Assignment Problem
Transportation Science
| Hi-index | 0.00 |
We consider the problem of approximating the expected recourse function for two-stage stochastic programs. Our problem is motivated by applications that have special structure, such as an underlying network that allows reasonable approximations to the expected recourse function to be developed. In this paper, we show how these approximations can be improved by combining them with sample gradient information from the true recourse function. For the case of strictly convex nonlinear approximations, we prove convergence for this hybrid approximation. The method is attractive for practical reasons because it retains the structure of the approximation.