Optimization of discrete variable stochastic systems by computer simulation

A heuristic procedure is developed for determining the optimum values of the decision variables of discrete variable systems whose performances are evaluated by computer simulation. The objective function and some of the constraints of this optimization are various responses of the simulated model. The constrained simplex search method is the basis of this development. However, due to the stochastic nature of the simulation responses, the vertices of the simplex are compared statistically. The algorithm uses a variable simulation run length to minimize the required computer time. The data on the simulation output at each decision point are monitored continuously and, as soon as a statistically reliable comparison among the alternatives can be made, the simulation run at that point is terminated. The whole procedure is developed into an algorithm that can be interfaced with the simulation model built by the analyst. In this paper, the significant aspects of the algorithm and its application to a practical problem as well as the results of the comparison of its performance with respect to two other optimization search methods are presented.

[1]  Hans-Paul Schwefel,et al.  Superimposing direct search methods for parameter optimization onto dynamic simulation models , 1978, WSC '78.

[2]  Robert C. Meier The Application of Optimum-Seeking Techniques to Simulation Studies: A Preliminary Evaluation , 1967 .

[3]  David L. Eldredge Experimental optimization of statistical simulation , 1974, WSC '74.

[4]  G. Hogg,et al.  UNCONSTRAINED DISCRETE NONLINEAR PROGRAMMING , 1979 .

[5]  A. Vasilopoulos,et al.  Modification of Control Chart Limits in the Presence of Data Correlation , 1978 .

[6]  Dennis E. Smith Automatic optimum-seeking program for digital simulation , 1976 .

[7]  M. J. Box A New Method of Constrained Optimization and a Comparison With Other Methods , 1965, Comput. J..

[8]  Basil A. Kalymon An Optimization Algorithm for a Linear Model of a Simulation System , 1975 .

[9]  J. W. Schmidt,et al.  A heuristic elimination method for optimum selection of alternatives through simulation , 1973 .

[10]  Douglas C. Montgomery,et al.  Second-order response surface designs in computer simulation , 1975 .

[11]  Randall P. Sadowski,et al.  Simulation of robotic manufacturing cells: a modular approach , 1983 .

[12]  J. Talavage,et al.  Optimization of stochastic simulation models , 1980 .

[13]  M. T. Wasan Stochastic Approximation , 1969 .

[14]  G. R. Hext,et al.  Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation , 1962 .

[15]  Ronald J. Ebert,et al.  Search and Simulation Selection of a Job-Shop Sequencing Rule , 1975 .

[16]  Ardavan Nozari,et al.  Application of an optimization procedure to steady-state simulation , 1984, WSC '84.

[17]  Douglas C. Montgomery,et al.  A response surface approach to improving traffic signal settings in a street network , 1972 .

[18]  Claude Dennis Pegden,et al.  Decision optimization for GASP IV simulation models , 1977, WSC '77.

[19]  William Ernest Biles,et al.  A gradient—regression search procedure for simulation experimentation , 1974, WSC '74.

[20]  Gordon S. G. Beveridge,et al.  Optimization: theory and practice , 1970 .

[21]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[22]  Dean H. Kropp,et al.  Use of both optimization and simulation models to analyze complex systems , 1978, WSC '78.

[23]  V. Nollau Kushner, H. J./Clark, D. S., Stochastic Approximation Methods for Constrained and Unconstrained Systems. (Applied Mathematical Sciences 26). Berlin‐Heidelberg‐New York, Springer‐Verlag 1978. X, 261 S., 4 Abb., DM 26,40. US $ 13.20 , 1980 .

[24]  Michael G. Sovereign,et al.  A Recursive Optimization and Simulation Approach to Analysis with an Application to Transportation Systems , 1972 .

[25]  Guy L. Curry,et al.  On optimizing certain nonlinear convex functions which are partially defined by a simulation process , 1977, Math. Program..