Global optimization using a genetic algorithm with hierarchically structured population

This paper applies a genetic algorithm with hierarchically structured population to solve unconstrained optimization problems. The population has individuals distributed in several overlapping clusters, each one with a leader and a variable number of support individuals. The hierarchy establishes that leaders must be fitter than its supporters with the topological organization of the clusters following a tree. Computational tests evaluate different population structures, population sizes and crossover operators for better algorithm performance. A set of known benchmark test problems is solved and the results found are compared with those obtained from other methods described in the literature, namely, two genetic algorithms, a simulated annealing, a differential evolution and a particle swarm optimization. The results indicate that the method employed is capable of achieving better performance than the previous approaches in regard as the two criteria usually employed for comparisons: the number of function evaluations and rate of success. The method also has a superior performance if the number of problems solved is taken into account. (C) 2013 Elsevier B.V. All rights reserved.

Prospecção química e biológica do fungo endofítico Camarops sp. isolado de Alibertia macrophylla (Rubiaceae)

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Nonsmooth continuous-time optimization problems: Necessary conditions

We consider Lipschitz continuous-time nonlinear optimization problems and provide first-order necessary optimality conditions of both Fritz John and Karush-Kuhn-Tucker types. (C) 2001 Elsevier B.V. Ltd. All rights reserved.

Nonsmooth continuous-time optimization problems: Sufficient conditions

We discuss sufficient conditions of optimality for nonsmooth continuous-time nonlinear optimization problems under generalized convexity assumptions. These include both first-order and second-order criteria. (C) 1998 Academic Press.

Optimization procedures in the design of continuous induction hardening and tempering installations for magnetic steel bars

An inverse problem concerning the industrial process of steel bars hardening and tempering is considered. The associated optimization problem is formulated in terms of membership functions and, for the sake of comparison, also in terms of quadratic residuals; both geometric and electromagnetic design variables have been considered. The numerical solution is achieved by coupling a finite difference procedure for the calculation of the electromagnetic and thermal fields to a deterministic strategy of minimization based on modified Flctcher and Reeves method. © 1998 IEEE.

A note on KKT-invexity in nonsmooth continuous-time optimization

We introduce the notion of KKT-inverity for nonsmooth continuous-time nonlinear optimization problems and prove that this notion is a necessary and sufficient condition for every KKT solution to be a global optimal solution.

Optimization Strategies Based on Sequential Quadratic Programming Applied for a Fermentation Process for Butanol Production

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Discrete approximations for strict convex continuous time problems and duality

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Global optimization approach for the H2-norm model reduction problem

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.

Global optimization for the ℋ∞-norm model reduction problem

A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and upper bounds in the optimization procedure are described by linear matrix inequalities (LMI). Also proposed are two methods with which to reduce the convergence time of the branch and bound algorithm: the first one uses the Hankel singular values as a sufficient condition to stop the algorithm, providing to the method a fast convergence to the global optimum. The second one assumes that the reduced model is in the controllable or observable canonical form. The [image omitted]-norm of the error between the original model and the reduced model is considered. Examples illustrate the application of the proposed method.

Optimization of satellite constellations in the moon

Nowadays, we return to live a period of lunar exploration. China, Japan and India heavily invest in missions to the moon, and then try to implement manned bases on this satellite. These bases must be installed in polar regions due to the apparent existence of water. Therefore, the study of the feasibility of satellite constellations for navigation, control and communication recovers importance. The Moon's gravitational potential and resonant movements due to the proximity to Earth as the Kozai-Lidov resonance, must be considered in addition to other perturbations of lesser magnitude. The usual satellite constellations provide, as a basic feature, continuous and global coverage of the Earth. With this goal, they are designed for the smallest number of objects possible to perform a specific task and this amount is directly related to the altitude of the orbits and visual abilities of the members of the constellation. However the problem is different when the area to be covered is reduced to a given zone. The required number of space objects can be reduced. Furthermore, depending on the mission requirements it may be not necessary to provide continuous coverage. Taking into account the possibility of setting up a constellation that covers a specific region of the Moon on a non-continuous base, in this study we seek a criterion of optimization related to the time between visits. The propagation of the orbits of objects in the constellation in conjunction with the coverage constraints, provide information on the periods of time in which points of the surface are covered by a satellite, and time intervals in which they are not. So we minimize the time between visits considering several sets of possible constellations and using genetic algorithms.

Crop optimization and pre-steps standardization to get a Bipolaris euphorbiae-based bioherbicide

Making bioproducts available to the market requires finding appropriate processes for mass production and formulation of biological agents. This study aimed at evaluating the Bipolaris euphorbiae production in a solid medium (fermentation in solid substrate) and in a biphasic system (growth in a liquid medium followed by growth in a solid medium), as well as determining the processes for collecting and drying conidia, under laboratory conditions. The influence of the incubation period and inoculum quantity were also investigated. The conidia were dried by using an oven (30ºC, 35ºC, 40ºC, 45ºC, 50ºC, 55ºC and 60ºC), and laminar flow, continuous air flow and aseptic chamber at room temperature. Dry conidia were obtained by sieving and grinding in a ball mill, hammer mill or grain grinder. The conidia viability and sporulation efficiency were evaluated in the solid medium and in the biphasic system. For growth period, the best sporulation on solid medium was obtained after 10 days of incubation, reaching 8.3 x 10(7) conidia g-1 of substrate. The biphasic system did not increase the B. euphorbiae sporulation (4.5 x 10(7) conidia g-1 of substrate), after 14 days, and the amount of liquid inoculum used in this system was not an important factor for increasing its production. The continuous air flow and laminar flow preserved the conidial viability (94.6% and 99.1%, respectively), while promoting a great moisture loss (62.6% and 54.0%, respectively). All the grinding processes reduced the conidia germination (86.2%, 10.5% and 12%, respectively), while sieving allowed the collecting of powdered conidia with high viability (94.8%).

Ethanol production by Zymomonas mobilis during sucrose fermentation: Optimization of culture conditions using factorial design

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Electrochemical oxidation of landfill leachate in a flow reactor: optimization using response surface methodology

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)