Search

Abstract: This paper presents a new individual based optimization algorithm, which is inspired from asexual reproduction known as a remarkable biological phenomenon, called as asexual reproduction optimization (ARO). ARO can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survive according to a performance index obtained from the underlying objective function of the optimization problem; this leads to the fitter individual. ARO adaptive search ability along with its strength and weakness points are fully described in the paper. Furthermore, the ARO convergence to the global optimum is mathematically analyzed. To approve the effectiveness of the ARO performance, it is tested with several benchmark functions frequently used in the area of optimization. Finally, the ARO performance is statistically compared with that of an improved genetic algorithm (GA). Results of simulation illustrate that ARO remarkably outperforms GA. [ABSTRACT FROM AUTHOR]

Abstract: This paper outlines the basic concept and principles of two simple and powerful swarm intelligence tools: the particle swarm optimization (PSO) and the Bacterial Foraging Optimization (BFO). The adaptive identification of an unknown plant has been formulated as an optimization problem and then solved using the PSO and BFO techniques. Using this new approach efficient identification of complex nonlinear dynamic plants have been carried out through simulation study. [Copyright &y& Elsevier]

In this paper, we consider a class of optimal control problems in which the dynamical system involves both switching and impulsive controls. The number of switching times are supposed to be finite and, without loss of generality, to occur together with the impulses. We show that this class of optimal control problems is equivalent to a special class of optimal parameter selection problems. The gradient formulae for the cost functional and the constraint functional are derived. On this basis, the control parameterization is shown to be applicable for numerical solution. A numerical example is solved for illustration. [Copyright &y& Elsevier]