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 is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aoki, M., 1971.Introduction to Optimization Techniques. New York: Macmillan, 131–146.
Box, G.E. and Draper, N.R., 1987.Empirical Model-Building and Response Surfaces. New York: Wiley.
Brightman, H.J., 1978. Optimization through experimentation: Applying the response surface methods.Decision Sci. 9:481–495.
Fu, M.C., 1990. Convergence of a stochastic approximation algorithm for the GI/G/1 queue using infinitesimal perturbation analysis.J. Optim. Theory Appl., 65:149–160.
Gaivoronski, A.A., 1990. Stochastic programming techniques for optimization of discrete event systems. Manuscript.
Gaivoronski, A.A., 1982. Approximation methods of solution to stochastic programming problems.Cybernetics, 18:145–270.
Glasserman, P., and Yao, D.D., 1991. Algebraic structure of some stochastic discrete even systems.Discrete Event Dynamic Sys. 1:7–35.
Glynn, P.W., 1986. Stochastic approximation for Monte Carlo optimization.Proc. 1986 Winter Simulation Conf. 356–364.
Hill, W.J., and Hunter, W.G., 1966. A review of response surface methodology: A literature survey.Technometrics, 8:571–590.
Ho, Y.C., 1987. Performance evaluation and perturbation analysis of discrete event dynamics systems.IEEE Trans. Auto. Control, AC-32:563–572.
Ho. Y.C. and Cao, X., 1991.Perturbation Analysis of Discrete Event Dynamic Systems, Boston: Kluwer.
Ho, Y.C. and Cao, X., 1987. Estimating the sojourn time sensitivity in queueing networks using perturbation analysis.J. Optim. Theory App., 53:353–375.
Ho, Y.C. and Cao, X., 1983. Perturbation analysis and optimization of queueing networks.J. Optim. Theory App., 40:559–582.
Jacobson, S.H. and Schruben L.W., 1989. Techniques for simulation response optimization.Oper. Res. Lett.:1–9.
Kung, H.T., 1976. The complexity of obtaining starting points for solving operator equations by Newton's method. InAnalytic Comutational Complexity (J.F. Traub, ed.) New York: Academic Press.
Kushner, H., 1972. Stochastic approximation algorithms for the local optimization of functions and nonunique stationary points.IEEE Trans. Auto. Control, AC-17:646–654.
Lirov, Y. and Melamed, B., 1990. Expert design systems for telecommunications. Manuscript.
Luenberger, D.B., 1984.Introduction to Linear and Nonlinear Programming. Reading, MA: Addison-Wesley.
McKay, M.D., Conover, W.J., and Beckman, R.J., 1979. A comparison of three methods for selecting values of input variables in the analysis of output from computer code.Technometrics, 21:239–245.
Meketon, M.S., 1987. Optimization in simulation: A survey of recent results.Proc. 1987 Winter Simulation Conf. (A. Thesen, H. Grant, W. David Kelton, eds.):58–67.
Montgomery, D.C. and Bettencourt, Jr., V.M., 1977. Multiple response surface methods in computer simulation.Simulation, 29:113–121.
Myers, R.H., 1977.Response Surface Methodology. Boston, MA: Allyn and Bacon.
Reiman, I. and Weiss, A., 1989. Sensitivity analysis for simulation via likelihood ratios.Oper. Res. 37:(5)830–844.
Rubinstein, R., 1986.Monte Carlo Optimization, Simulation and Sensivity of Queueing Networks. New York: Wiley.
Sacks, J., Welch, W.J., Mitchell, T.J., and Wynn, H.P., 1989. Design and analysis of computer experiments.Statistical Sci. 4:409–435.
Smith, D.E., 1973. An empirical investigation of optimum-seeking in the computer simulation situation.Oper. Res. 21:475–497.
Suri, R., 1989. Perturbation analysis: the state of the art and research issues explained via the GI/G/1 queue.Proc. IEEE, Special Issue Dynamics Discrete Event Syst. 77:114–137.
Suri, R. and Leung, Y.T., 1987. Single run optimization of a SIMAN model for automatic assembly systems.Proc. 1987 Winter Simulation Conf. (A. Thesen, H. Grant, W. David Kelton, eds.).
Traub, J.F., 1976. The introduction toAnalytical Computational Complexity (J.F. Traub, ed.). New York: Academic Press.
Vazquez-Abad, F.J., 1989. Stochastic recursive algorithms for optimal routing in queueing networks. Ph.D. thesis, Brown University.
Wardi, Y., and Lee, K., 1990. Application of descent algorithms with Armijo stepsizes to simulation-based optimization of queueing networks. Manuscript.
Author information
Authors and Affiliations
Additional information
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.
Rights and permissions
About this article
Cite this article
Ho, Y.C., Shi, L., Dai, L. et al. Optimizing discrete event dynamic systems via the gradient surface method. Discrete Event Dyn Syst 2, 99–120 (1992). https://doi.org/10.1007/BF01797723
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01797723