Discrete Time Multi-servers Loss Systems and Stochastic Approximation with Delayed Groups of Customers

The stochastic approximation procedure with delayed groups of delayed customers is investigated. The Robbins-Monro stochastic approximation procedure is adjusted to be usable in the presence of delayed groups of delayed customers. Two loss systems are introduced to get an accurate description of the proposed procedure. Each customer comes after fixed time-intervals with the stage of the following customer is accurate according to the outcome of the preceding one, where the serving time of a customer is assumed to be discrete random variable. Some applications of the procedure are given where the analysis of their results is obtained. The analysis shows that efficiencies of the procedure can be increased by minimizing the number of customers of a group irrespective of their service times that may take maximum values. Efficiencies depend on the maximum service time of the customer and on the number of customers of the group. The most important result is that efficiencies of the procedure are increased by increasing the service time distributions as well as service times of customers .This new situation can be applied to increase the number of served customers where the number of served groups will also be increased. The results obtained seem to be acceptable. In general, our proposal can be utilized to other stochastic approximation procedures to increase the production in many fields such as medicine, computer sciences, industry, and applied sciences.

Control problem for the impulse process under stochastic optimization procedure and Levy conditions

A stochastic approximation procedure and a limit generator of the original problem are constructed for a system of stochastic differential equations with Markov switching and impulse perturbation under Levy approximation conditions with control, which is determined by the condition for the extremum of the quality criterion function.The control problem using the stochastic optimization procedure is a generalization of the control problem with the stochastic approximation procedure, which was studied in previous works of the authors. This generalization is not simple and requires non-trivial approaches to solving the problem. In particular we discuss how the behavior of the boundary process depends on the prelimiting stochastic evolutionary system in the ergodic Markov environment. The main assumption is the condition for uniform ergodicity of the Markov switching process, that is, the existence of a stationary distribution for the switching process over large time intervals. This allows one to construct explicit algorithms for the analysis of the asymptotic behavior of a controlled process. An important property of the generator of the Markov switching process is that the space in which it is defined splits into the direct sum of its zero-subspace and a subspace of values, followed by the introduction of a projector that acts on the subspace of zeros.For the first time, a model of the control problem for the diffusion transfer process using the stochastic optimization procedure for control problem is proposed. A singular expansion in the small parameter of the generator of the three-component Markov process is obtained, and the problem of a singular perturbation with the representation of the limiting generator of this process is solved.

Computational Schemes for Optimizing Domains of Attraction in Dynamical Systems

In this paper, several computational schemes are presented for the optimal tuning of the global behavior of nonlinear dynamical systems. Specifically, the maximization of the size of domains of attraction associated with invariants in parametrized dynamical systems is addressed. Cell Mapping (CM) techniques are used to estimate the size of the domains, and such size is then maximized via different optimization tools. First, a genetic algorithm is tested whose performance shows to be good for determining global maxima at the expense of high computational cost. Secondly, an iterative scheme based on a Stochastic Approximation procedure (the Kiefer-Wolfowitz algorithm) is evaluated showing acceptable performance at low cost. Finally, several schemes combining neural network based estimations and optimization procedures are addressed with promising results. The performance of the methods is illustrated with two applications: first on the well-known van der Pol equation with standard parametrization, and second the tuning of a controller for saturated systems.