Search

The Interior Epigraph Directions (IED) method for solving constrained nonsmooth and nonconvex optimization problem via Generalized Augmented Lagrangian Duality considers the dual problem induced by a Generalized Augmented Lagrangian Duality scheme and obtains the primal solution by generating a sequence of iterates in the interior of the epigraph of the dual function. In this approach, the value of the dual function at some point in the dual space is given by minimizing the Lagrangian. The first version of the IED method uses the Matlab routine fminsearch for this minimization. The second version uses NFDNA, a tailored algorithm for unconstrained, nonsmooth and nonconvex problems. However, the results obtained with fminsearch and NFDNA were not satisfactory. The current version of the IED method, presented in this work, employs a Genetic Algorithm, which is free of any strategy to handle the constraints, a difficult task when a metaheuristic, such as GA, is applied alone to solve constrained optimization problems. Two sets of constrained optimization problems from mathematics and mechanical engineering were solved and compared with literature. It is shown that the proposed hybrid algorithm is able to solve problems where fminsearch and NFDNA fail. [ABSTRACT FROM AUTHOR]

This paper deals with sizing and shape structural optimization problems with respect to the minimization of the masses of truss structures considering multiple natural frequencies as the constraints of the problems. The sizing and shape design variables are discrete and continuous, respectively. It can be attractive to use a reduced number of distinct cross-sectional areas minimizing costs of fabrication, transportation, storing, checking, welding, and so on. Also, it is expected a labor-saving when the structure is welded, checked and so on. On the other hand, one can observe that the task of discovering the optimum member grouping is not trivial and leads to an exhaustive trial-and-error process. Cardinality constraints are adopted in order to obtain an automatic variable linking searching for the best member grouping of the bars of the trusses analyzed in this paper. A CRPSO (Craziness based Particle Swarm Optimization) is the search algorithm adopted in this paper. This algorithm uses a modified velocity expression and an operator called 'craziness velocity' in order to avoid premature convergence. An Adaptive Penalty Method is adopted to handle the constraints. Six truss structures are analyzed, presenting very interesting results providing curves of tradeoff between the optimized weights versus the number of distinct cross-sectional areas used in these solutions. [ABSTRACT FROM AUTHOR]

Purpose – The purpose of this paper is to propose variants of an adaptive penalty scheme for steady-state genetic algorithms applied to constrained engineering optimization problems. Design/methodology/approach – For each constraint a penalty parameter is adaptively computed along the evolution according to information extracted from the current population such as the existence of feasible individuals and the level of violation of each constraint. The adaptive penalty method (APM), as originally proposed, computes the constraint violations of the initial population, and updates the penalty coefficient of each constraint after a given number of new individuals are inserted in the population. A second variant, called sporadic APM with constraint violation accumulation, works by accumulating the constraint violations during a given insertion of new offspring into the population, updating the penalty coefficients, and fixing the penalty coefficients for the next generations. The APM with monotonic penalty coefficients is the third variation, where the penalty coefficients are calculated as in the original method, but no penalty coefficient is allowed to have its value reduced along the evolutionary process. Finally, the penalty coefficients are defined by using a weighted average between the current value of a coefficient and the new value predicted by the method. This variant is called the APM with damping. Findings – The paper checks new variants of an APM for evolutionary algorithms; variants of an APM, for a steady-state genetic algorithm based on an APM for a generational genetic algorithm, largely used in the literature previously proposed by two co-authors of this manuscript; good performance of the proposed APM in comparison with other techniques found in the literature; innovative and general strategies to handle constraints in the field of evolutionary computation. Research limitations/implications – The proposed algorithm has no limitations and can be applied in a large number of evolutionary algorithms used to solve constrained optimization problems. Practical implications – The proposed algorithm can be used to solve real world problems in engineering as can be viewed in the references, presented in this manuscript, that use the original (APM) strategy. The performance of these variants is examined using benchmark problems of mechanical and structural engineering frequently discussed in the literature. Originality/value – It is the first extended analysis of the variants of the APM submitted for possible publication in the literature, applied to real world engineering optimization problems. [ABSTRACT FROM AUTHOR]

Purpose The purpose of this paper is to propose and analyze the use of local surrogate models to improve differential evolution’s (DE) overall performance in computationally expensive problems.Design/methodology/approach DE is a popular metaheuristic to solve optimization problems with several variants available in the literature. Here, the offspring are generated by means of different variants, and only the best one, according to the surrogate model, is evaluated by the simulator. The problem of weight minimization of truss structures is used to assess DE’s performance when different metamodels are used. The surrogate-assisted DE techniques proposed here are also compared to common DE variants. Six different structural optimization problems are studied involving continuous as well as discrete sizing design variables.Findings The use of a local, similarity-based, surrogate model improves the relative performance of DE for most test-problems, specially when using r-nearest neighbors with r = 0.001 and a DE parameter F = 0.7.Research limitations/implications The proposed methods have no limitations and can be applied to solve constrained optimization problems in general, and structural ones in particular.Practical/implications The proposed techniques can be used to solve real-world problems in engineering. Also, the performance of the proposals is examined using structural engineering problems.Originality/value The main contributions of this work are to introduce and to evaluate additional local surrogate models; to evaluate the effect of the value of DE’s parameter F (which scales the differences between components of candidate solutions) upon each surrogate model; and to perform a more complete set of experiments covering continuous as well as discrete design variables. [ABSTRACT FROM AUTHOR]

Nature inspired meta-heuristics are largely used to solve optimization problems. However, these techniques should be adapted when solving constrained optimization problems, which are common in real world situations. Here an adaptive penalty approach (called Adaptive Penalty Method, APM) is combined with a particle swarm optimization (PSO) technique to solve constrained optimization problems. This approach is analyzed using a benchmark of test-problems and 5 mechanical engineering problems. Moreover, three variants of APM are considered in the computational experiments. Comparison results show that the proposed algorithm obtains a promising performance on the majority of the test problems. [ABSTRACT FROM AUTHOR]

One variant of the ant colony optimization (ACO) metaheuristic, known as rank-based ant system (RBAS), is proposed for weight minimization of structures involving discrete design variables. Stress and displacements constraints are handled using a penalty technique, and the structural analysis is performed by the finite element method. Results obtained for several discrete weight minimization problems show that the RBAS algorithm implemented is effective and competitive when compared with results found by genetic algorithms and another RBAS variant. Copyright © 2006 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]