An efficient memetic algorithm for 3D shape matching problems

Shape representation plays a vital role in any shape optimization exercise. The ability to identify a shape with good functional properties is dependent on the underlying shape representation scheme, the morphing mechanism and the efficiency of the optimization algorithm. This article presents a novel and efficient methodology for morphing 3D shapes via smart repair of control points. The repaired sequence of control points are subsequently used to define the 3D object using a B-spline surface representation. The control points are evolved within the framework of a memetic algorithm for greater efficiency. While the authors have already proposed an approach for 2D shape matching, this article extends it further to deal with 3D shape matching problems. Three 3D examples and a real customized 3D earplug design have been used as examples to illustrate the performance of the proposed approach and the effectiveness of the repair scheme. Complete details of the problems are presented for future work in this direction.     

MOEA/D-SQA: a multi-objective memetic algorithm based on decomposition

A multi-objective memetic algorithm based on decomposition is proposed in this article, in which a simplified quadratic approximation (SQA) is employed as a local search operator for enhancing the performance of a multi-objective evolutionary algorithm based on decomposition (MOEA/D). The SQA is used for a fast local search and the MOEA/D is used as the global optimizer. The multi-objective memetic algorithm based on decomposition, i.e. a hybrid of the MOEA/D with the SQA (MOEA/D-SQA), is designed to balance local versus global search strategies so as to obtain a set of diverse non-dominated solutions as quickly as possible. The emphasis of this article is placed on demonstrating how this local search scheme can improve the performance of MOEA/D for multi-objective optimization. MOEA/D-SQA has been tested on a wide set of benchmark problems with complicated Pareto set shapes. Experimental results indicate that the proposed approach performs better than MOEA/D. In addition, the results obtained are very competitive when comparing MOEA/D-SQA with other state-of-the-art techniques.     

A comparative study of controlled random search algorithms with application to inverse aerofoil design

This article presents a comparative study of some versions of the controlled random search algorithm (CRSA) in global optimization problems. The basic CRSA, originally proposed by Price in 1977 and improved by Ali et al. in 1997, is taken as a starting point. Then, some new modifications are proposed to improve the efficiency and reliability of this global optimization technique. The performance of the algorithms is assessed using traditional benchmark test problems commonly invoked in the literature. This comparative study points out the key features of the modified algorithm. Finally, a comparison is also made in a practical engineering application, namely the inverse aerofoil shape design.     

Structural shape optimization using equivalent static loads transformed from dynamic loads

In structural optimization, static loads are generally utilized although real external forces are dynamic. Dynamic loads have been considered only in small‐scale problems. Recently, an algorithm for dynamic response optimization using transformation of dynamic loads into equivalent static loads has been proposed. The transformation is conducted to match the displacement fields from dynamic and static analyses. This algorithm can be applied to large‐scale problems. However, the application has been limited to size optimization. The present study applies the algorithm to shape optimization. Because the number of degrees of freedom of finite element models is usually very large in shape optimization, it is difficult to conduct dynamic response optimization with conventional methods that directly treat dynamic response in the time domain. The optimization process is carried out by interfacing an optimization system and an analysis system for structural dynamics. Various examples are solved to verify the algorithm. The results are compared to the results from static loads. It is found that the algorithm using static loads transformed from dynamic loads based on displacement is valid for very large‐scale shape optimization problems. Copyright © 2005 John Wiley & Sons, Ltd.     

A multi-objective metamodel-assisted memetic algorithm with strength-based local refinement

Metamodel-assisted evolutionary algorithms are low-cost optimization methods for CPU-demanding problems. Memetic algorithms combine global and local search methods, aiming at improving the quality of promising solutions. This article proposes a metamodel-assisted memetic algorithm which combines and extends the capabilities of the aforementioned techniques. Herein, metamodels undertake a dual role: they perform a low-cost pre-evaluation of population members during the global search and the gradient-based refinement of promising solutions. This reduces significantly the number of calls to the evaluation tool and overcomes the need for computing the objective function gradients. In multi-objective problems, the selection of individuals for refinement is based on domination and distance criteria. During refinement, a scalar strength function is maximized and this proves to be beneficial in constrained optimization. The proposed metamodel-assisted memetic algorithm employs principles of Lamarckian learning and is demonstrated on mathematical and engineering applications.     

Eliminating Forging Defects Using Genetic Algorithms

In this article, an optimization method for metal forging process designs using finite element-based simulation is presented. Using as entry parameters the specifications of the final product the so-called inverse techniques developed for optimization problems allows the calculation of the optimal solution, the design parameters that produce the required product. An evolutionary genetic algorithm is proposed to calculate optimal shape geometry and temperature. An example demonstrating the efficiency of the developed method is presented considering a two-stage hot forging process. It considers optimization of the process parameters to reduce the difference between the realized and the prescribed final forged shape under minimal energy consumption, restricting the maximum temperature.     

Shape optimization with topological changes and parametric control

Recent advances in shape optimization rely on free-form implicit representations, such as level sets, to support boundary deformations and topological changes. By contrast, parametric shape optimization is formulated directly in terms of meaningful geometric design variables, but usually does not support free-form boundary and topological changes. We propose a novel approach to shape optimization that combines and retains the advantages of the earlier optimization techniques. The shapes in the design space are represented implicitly as level sets of a higher-dimensional function that is constructed using B-splines (to allow free-form deformations), and parameterized primitives combined with R-functions (to support desired parametric changes). Our approach to shape design and optimization offers great flexibility because it provides explicit parametric control of geometry and topology within a large space of free-form shapes. The resulting method is also general in that it subsumes most other types of shape optimization as special cases. We describe an implementation of the proposed technique with attractive numerical properties. The explicit construction of an implicit representation supports straightforward sensitivity analysis that can be used with most gradient-based optimization methods. Furthermore, our implementation does not require any error-prone polygonization or approximation of level sets (isocurves and isosurfaces). The effectiveness of the method is demonstrated by several numerical examples. Copyright © 2006 John Wiley & Sons, Ltd.     

STRUCTURAL SHAPE OPTIMIZATION USING EVOLUTION STRATEGIES

The objective of this paper is to investigate the efficiency of combinatorial optimization methods and in particular algorithms based on evolution strategies, when incorporated into shape optimization problems. Evolution strategy algorithms are used either on a stand-alone basis, or combined with a conventional mathematical programming technique. The numerical tests presented demonstrate the computational advantages of the proposed approach which become more pronounced in large-scale optimization problems and/or parallel computing environment.     

3D preform shape optimization in forging using reduced basis techniques

Three-dimensional preform shape optimization of complex forgings with a weighted summation of multiple basis shapes is presented in this article. Currently, 2D preform shape optimization is well developed; however, in cases in which the parts are neither axisymmetric nor plane strain, 2D assumptions do not hold well. The number of design variables required to define the 3D preform shape is high, making most iterative design methods impractical for shape optimization. The goal here is to make design optimization practical and efficient by developing reduced-order modeling techniques for 3D preform shape optimization. The preform shape is treated as a linear combination of various billet shapes, called basis shapes, with the weights for each basis shape used as design variables, thereby reducing the number of design variables. It is very difficult to obtain the necessary gradient information for 3D forging simulations, so a non-gradient method is used to build the surrogate model on which optimization is performed. The optimization problem is formulated to minimize strain variance while placing constraints on underfill. Representative problems are used to demonstrate the effectiveness of the approach.     

Pricing and location decisions in multi-objective facility location problem with M/M/m/k queuing systems

This article presents a new multi-objective model for a facility location problem with congestion and pricing policies. This model considers situations in which immobile service facilities are congested by a stochastic demand following M/M/m/k queues. The presented model belongs to the class of mixed-integer nonlinear programming models and NP-hard problems. To solve such a hard model, a new multi-objective optimization algorithm based on a vibration theory, namely multi-objective vibration damping optimization (MOVDO), is developed. In order to tune the algorithms parameters, the Taguchi approach using a response metric is implemented. The computational results are compared with those of the non-dominated ranking genetic algorithm and non-dominated sorting genetic algorithm. The outputs demonstrate the robustness of the proposed MOVDO in large-sized problems.     

OPTIMAL DESIGN FOR NON-STEADY-STATE METAL FORMING PROCESSES—II. APPLICATION OF SHAPE OPTIMIZATION IN FORGING

This paper is the second part of a two-part article about shape optimization of metal forming processes. This part is focused on numerical applications of the optimization method which has been described in the first paper. The main feature of this work is the analytical calculations of the derivatives of the objective function for a non-linear, non-steady-state problem with large deformations. The calculations are based on the differentiation of the discrete objective function and on the differentiation of the discrete equations of the forging problem. Our aim here is to show the feasibility and the efficiency of such a method with numerical examples. We recall the formulation and the resolution of the direct problem of hot axisymmetrical forging. Then, a first type of shape optimization problem is considered: the optimization of the shape of the initial part for a one-step forging operation. Two academic problems allow for checking the accuracy of the analytical derivatives, and for studying the convergence rate of the optimization procedure. Both constrained and unconstrained problems are considered. Afterwards, a second type of inverse problem of design is considered: the shape optimization of the preforming tool, for a two-step forging process. A satisfactory shape is obtained after few iterations of the optimization procedure.     

A parallel particle swarm optimization algorithm for multi-objective optimization problems

In this article, a new proposal of using particle swarm optimization algorithms to solve multi-objective optimization problems is presented. The algorithm is constructed based on the concept of Pareto dominance, as well as a state-of-the-art ‘parallel’ computing technique that intends to improve algorithmic effectiveness and efficiency simultaneously. The proposed parallel particle swarm multi-objective evolutionary algorithm (PPS-MOEA) is tested through a variety of standard test functions taken from the literature; its performance is compared with six noted multi-objective algorithms. The computational experience gained from the first two experiments indicates that the algorithm proposed in this article is extremely competitive when compared with other MOEAs, being able to accurately, reliably and robustly approximate the true Pareto front in almost every tested case. To justify the motivation behind the research of the parallel swarm structure, the computational results of the third experiment confirm the PPS-MOEA's merit in solving really high-dimensional multi-objective optimization problems.     

A boundary‐perturbation finite element approach for shape optimization

A numerical method is proposed for the efficient solution of shape optimization problems, which combines the boundary perturbation technique and finite element analysis. The method is computationally efficient in that it requires a number of finite element analyses with a fixed geometry, as opposed to standard shape optimization which requires re‐analysis with varying geometry. The application of the method to general shape optimization is considered. In addition, a special optimization scheme is devised for a class of problems governed by linear partial differential equations. The performance of the method is illustrated via an example which involves acoustic wave scattering from an obstacle. Copyright © 2000 John Wiley & Sons, Ltd.     

MONSS: A multi-objective nonlinear simplex search approach

This article presents a novel methodology for dealing with continuous box-constrained multi-objective optimization problems (MOPs). The proposed algorithm adopts a nonlinear simplex search scheme in order to obtain multiple elements of the Pareto optimal set. The search is directed by a well-distributed set of weight vectors, each of which defines a scalarization problem that is solved by deforming a simplex according to the movements described by Nelder and Mead's method. Considering an MOP with n decision variables, the simplex is constructed using n+1 solutions which minimize different scalarization problems defined by n+1 neighbor weight vectors. All solutions found in the search are used to update a set of solutions considered to be the minima for each separate problem. In this way, the proposed algorithm collectively obtains multiple trade-offs among the different conflicting objectives, while maintaining a proper representation of the Pareto optimal front. In this article, it is shown that a well-designed strategy using just mathematical programming techniques can be competitive with respect to the state-of-the-art multi-objective evolutionary algorithms against which it was compared.     

Truss topology,shape and sizing optimization by fully stressed design based on hybrid grey wolf optimization and adaptive differential evolution

A hybrid adaptive optimization algorithm based on integrating grey wolf optimization into adaptive differential evolution with fully stressed design (FSD) local search is presented in this article. Hybrid reproduction and control parameter adaptation strategies are employed to increase the performance of the algorithm. The proposed algorithm, called fully stressed design–grey wolf–adaptive differential evolution (FSD-GWADE), is demonstrated to tackle a variety of truss optimization problems. The problems have mixed continuous/discrete design variables that are assigned as simultaneous topology, shape and sizing design variables. FSD-GWADE provides competitive results and gives superior results at a higher success rate than the previous FSD-based algorithm.     

Aerodynamic optimization using a parallel asynchronous evolutionary algorithm controlled by strongly interacting demes

A parallel asynchronous evolutionary algorithm controlled by strongly interacting demes for single- and multi-objective optimization problems is proposed. It is suitable even for non-homogeneous, multiprocessor systems, ensuring maximum exploitation of the available processors. The search algorithm utilizes a structured topology of evaluation agents organized in a number of inter-communicating demes arranged on a 2D supporting mesh. Once an evaluation terminates and a processor becomes idle, a series of intra- and inter-deme processes determines the next agent to undergo evaluation on this specific processor. Real coding and differential evolution operators are used. Mathematical and aerodynamic-turbomachinery optimization problems are presented to assess the proposed method in terms of CPU cost, parallel efficiency and quality of solutions obtained within a predefined number of evaluations. Comparisons with conventional evolutionary algorithms, parallelized based on the master–slave model on the same computational platform, are presented.     

A hybrid cellular automaton–bi-directional evolutionary optimization algorithm for topological optimization of crashworthiness

This article proposes a new algorithm for topological optimization under dynamic loading which combines cellular automata with bi-directional evolutionary structural optimization (BESO). The local rules of cellular automata are used to update the design variables, which avoids the difficulty of obtaining gradient information under nonlinear collision conditions. The intermediate-density design problem of hybrid cellular automata is solved using the BESO concept of 0–1 binary discrete variables. Some improvement strategies are also proposed for the hybrid algorithm to solve certain problems in nonlinear topological optimization, e.g. numerical oscillation. Some typical examples of crashworthiness problems are provided to illustrate the efficiency of the proposed method and its ability to find the final optimal solution. Finally, numerical results obtained using the proposed algorithms are compared with reference examples taken from the literature. The results show that the hybrid method is computationally efficient and stable.     

Entropy minimization in turbine cascade using continuous adjoint formulation

A complete continuous adjoint formulation is presented here for the optimization of the turbulent flow entropy generation rate through a turbine cascade. The adjoint method allows one to have many design variables, but still afford to compute the objective function gradient. The new adjoint system can be applied to different structured and unstructured grids as well as mixed subsonic and supersonic flows. For turbulent flow simulation, the k–ω shear-stress transport turbulence model and Roe's flux function are used. To ensure all possible shape models, a mesh-point method is used for design parameters, and an implicit smoothing function is implemented to avoid the generation of non-smoothed blades. To analyse the capability of the presented algorithm, the shape of a turbine cascade blade is redesigned and a few physical observations are made on how the scheme improves the blade performance.     

A multi-objective approach for multi-material topology and shape optimization

An automated multi-material approach that integrates multi-objective Topology Optimization (TO) and multi-objective shape optimization is presented. A new ant colony optimization algorithm is presented and applied to solving the TO problem, estimating a trade-off set of initial topologies or distributions of material. The solutions found usually present irregular boundaries, which are not desirable in applications. Thus, shape parameterization of the internal boundaries of the design region, and subsequent shape optimization, is performed to improve the quality of the estimated Pareto-optimal solutions. The selection of solutions for shape optimization is done by using the PROMETHEE II decision-making method. The parameterization process involves identifying the boundaries of different materials and describing these boundaries by non-uniform rational B-spline curves. The proposed approach is applied to the optimization of a C-core magnetic actuator, with two objectives: the maximization of the attractive force on the armature and the minimization of the volume of permanent magnet material.     

Stresses,stress sensitivities and shape optimization in two-dimensional linear elasticity by the Boundary Contour Method

This paper presents new formulations for computing stresses as well as their sensitivities in two-dimensional (2-D) linear elasticity by the Boundary Contour Method (BCM). Contrary to previous work (e.g. Reference 1), the formulations presented here are established directly from the boundary contour version of the Hypersingular Boundary Integral Equation (HBIE) which can provide accurate numerical results and is very efficient with regard to numerical implementation as well as computational time. The Design Sensitivity Coefficients (DSCs) computed from the above formulations are then coupled with a mathematical programming method, here the Successive Quadratic Programming (SQP) algorithm, in order to solve shape optimization problems. Numerical examples are presented to demonstrate the validity of the new formulations for calculation of DSCs. Also, based on these formulations, shape optimization examples by the BCM are presented here for the first time. © 1998 John Wiley & Sons, Ltd.