A Chaotic Approach of Differential Evolution Optimization Applied to Loudspeaker Design Problem

Over the past few years, the field of global optimization has been very active, producing different kinds of deterministic and stochastic algorithms for optimization in the continuous domain. These days, the use of evolutionary algorithms (EAs) to solve optimization problems is a common practice due to their competitive performance on complex search spaces. EAs are well known for their ability to deal with nonlinear and complex optimization problems. Differential evolution (DE) algorithms are a family of evolutionary optimization techniques that use a rather greedy and less stochastic approach to problem solving, when compared to classical evolutionary algorithms. The main idea is to construct, at each generation, for each element of the population a mutant vector, which is constructed through a specific mutation operation based on adding differences between randomly selected elements of the population to another element. Due to its simple implementation, minimum mathematical processing and good optimization capability, DE has attracted attention. This paper proposes a new approach to solve electromagnetic design problems that combines the DE algorithm with a generator of chaos sequences. This approach is tested on the design of a loudspeaker model with 17 degrees of freedom, for showing its applicability to electromagnetic problems. The results show that the DE algorithm with chaotic sequences presents better, or at least similar, results when compared to the standard DE algorithm and other evolutionary algorithms available in the literature.

Multiobjective Biogeography-Based Optimization Based on Predator-Prey Approach

Biogeography is the science that studies the geographical distribution and the migration of species in an ecosystem. Biogeography-based optimization (BBO) is a recently developed global optimization algorithm as a generalization of biogeography to evolutionary algorithm and has shown its ability to solve complex optimization problems. BBO employs a migration operator to share information between the problem solutions. The problem solutions are identified as habitat, and the sharing of features is called migration. In this paper, a multiobjective BBO, combined with a predator-prey (PPBBO) approach, is proposed and validated in the constrained design of a brushless dc wheel motor. The results demonstrated that the proposed PPBBO approach converged to promising solutions in terms of quality and dominance when compared with the classical BBO in a multiobjective version.

Investigating Smart Sampling as a population initialization method for Differential Evolution in continuous problems

Recently, researches have shown that the performance of metaheuristics can be affected by population initialization. Opposition-based Differential Evolution (ODE), Quasi-Oppositional Differential Evolution (QODE), and Uniform-Quasi-Opposition Differential Evolution (UQODE) are three state-of-the-art methods that improve the performance of the Differential Evolution algorithm based on population initialization and different search strategies. In a different approach to achieve similar results, this paper presents a technique to discover promising regions in a continuous search-space of an optimization problem. Using machine-learning techniques, the algorithm named Smart Sampling (SS) finds regions with high possibility of containing a global optimum. Next, a metaheuristic can be initialized inside each region to find that optimum. SS and DE were combined (originating the SSDE algorithm) to evaluate our approach, and experiments were conducted in the same set of benchmark functions used by ODE, QODE and UQODE authors. Results have shown that the total number of function evaluations required by DE to reach the global optimum can be significantly reduced and that the success rate improves if SS is employed first. Such results are also in consonance with results from the literature, stating the importance of an adequate starting population. Moreover, SS presents better efficacy to find initial populations of superior quality when compared to the other three algorithms that employ oppositional learning. Finally and most important, the SS performance in finding promising regions is independent of the employed metaheuristic with which SS is combined, making SS suitable to improve the performance of a large variety of optimization techniques. (C) 2012 Elsevier Inc. All rights reserved.

The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems

Augmented Lagrangian methods are effective tools for solving large-scale nonlinear programming problems. At each outer iteration, a minimization subproblem with simple constraints, whose objective function depends on updated Lagrange multipliers and penalty parameters, is approximately solved. When the penalty parameter becomes very large, solving the subproblem becomes difficult; therefore, the effectiveness of this approach is associated with the boundedness of the penalty parameters. In this paper, it is proved that under more natural assumptions than the ones employed until now, penalty parameters are bounded. For proving the new boundedness result, the original algorithm has been slightly modified. Numerical consequences of the modifications are discussed and computational experiments are presented.

Characterization and optimization of ArtinM lectin expression in Escherichia coli

Background ArtinM is a D-mannose-specific lectin from Artocarpus integrifolia seeds that induces neutrophil migration and activation, degranulation of mast cells, acceleration of wound healing, induction of interleukin-12 production by macrophages and dendritic cells, and protective T helper 1 immune response against Leishmania major, Leishmania amazonensis and Paracoccidioides brasiliensis infections. Considering the important biological properties of ArtinM and its therapeutic applicability, this study was designed to produce high-level expression of active recombinant ArtinM (rArtinM) in Escherichia coli system. Results The ArtinM coding region was inserted in pET29a(+) vector and expressed in E. coli BL21(DE3)-Codon Plus-RP. The conditions for overexpression of soluble ArtinM were optimized testing different parameters: temperatures (20, 25, 30 or 37°C) and shaking speeds (130, 200 or 220 rpm) during induction, concentrations of the induction agent IPTG (0.01-4 mM) and periods of induction (1-19 h). BL21-CodonPlus(DE3)-RP cells induced under the optimized conditions (incubation at 20°C, at a shaking speed of 130 rpm, induction with 0.4 mM IPTG for 19 h) resulted in the accumulation of large amounts of soluble rArtinM. The culture provided 22.4 mg/L of rArtinM, which activity was determined by its one-step purification through affinity chromatography on immobilized D-mannose and glycoarray analysis. Gel filtration showed that rArtinM is monomeric, contrasting with the tetrameric form of the plant native protein (jArtinM). The analysis of intact rArtinM by mass spectrometry revealed a 16,099.5 Da molecular mass, and the peptide mass fingerprint and esi-cid-ms/ms of amino acid sequences of peptides from a tryptic digest covered 41% of the total ArtinM amino acid sequence. In addition, circular dichroism and fluorescence spectroscopy of rArtinM indicated that its global fold comprises β-sheet structure. Conclusions Overall, the optimized process to express rArtinM in E. coli provided high amounts of soluble, correctly folded and active recombinant protein, compatible with large scale production of the lectin.