Showing papers on "Metaheuristic published in 1974"

The optimization problem

Abstract: The requirement for methods of optimization arises from the mathematical complexity necessary to describe the theory of systems, processes, equipment, and devices which occur in practice. Even quite simple systems must sometimes be represented by theory which may contain approximations, by parameters which change with time, or by parameters that vary in a random manner. For many reasons the theory is imperfect, yet it must be used to predict the optimum operating conditions of a system such that some performance criterion is satisfied. At best such theory can predict only that the system is near to the desired optimum. Optimization methods are then used to explore the local region of operation and predict the way that the system parameters should be adjusted to bring the system to optimum.

An Adaptive Search Optimization Algorithm

Abstract: A very fast nongradient procedure for function optimization is described. The procedure is based on the ideas of Rosenbrock [1] and Swann [2]. These were modified and refined to obtain an algorithm which provides an optimum with a very small number of function evaluations. This algorithm, compared with recently reported algorithms by Lawrence and Steglitz (L-S) [3], and Beltrami and Indusi (B-I) [4], appears to be very robust and reliable. Constrained optimization problems can be handled and a special method for handling optimization with linear constraints is presented.