Optimizing discrete event dynamic systems via the gradient surface method |
| |
Authors: | Y C Ho Leyuan Shi Liyi Dai Wei-Bo Gong |
| |
Affiliation: | (1) Division of Applied Sciences, Harvard University, 02138 Cambridge, MA;(2) Electrical and Computer Engineering Department, University of Massachusetts, 01003 Amherst, MA |
| |
Abstract: | In this paper we propose a gradient surface method (GSM) for the optimization of discrete event dynamic systems. GSM combines the advantages of response surface methodology (RSM) and efficient derivative estimation techniques like perturbation analysis (PA) or likelihood ratio method (LR). In GSM, the gradient estimation is obtained by PA (or LR), and the performance gradient surface is obtained from observations at various points in a fashion similar to the RSM. Zero points of the successive approximating gradient surface are then taken as the estimates of the optimal solution. GSM is characterized by several attractive features: it is a single-run method and more efficient than RSM; it uses at each iteration step the information from all data points rather than just the local gradient; it tries to capture the global features of the gradient surface and thereby quickly arrives at the vicinity of the optimal solution. A number of examples are exhibited to illustrate this method.This work was supported by the Office of Naval Research Grants Nos. N00014-90-K-1093 and N00014-89-J-1023, by National Science Foundation Grant No. ECS-85-15449 and by Army Grant No. DAAL-03-86-K-0171. |
| |
Keywords: | discrete event dynamic systems stochastic optimization response surface gradient surface perturbation analysis likelihood ratios single-run optimization |
本文献已被 SpringerLink 等数据库收录! |