An improved marine predators algorithm for shape optimization of developable Ball surfaces

Picking a subset of possible features is a vital step in the data-mining procedure. The decisive goal of feature-selection is to determine the optimal number of superior characteristics to make best use of the presentation of the learning algorithm. However, this problem becomes increasingly challenging to resolve as the number of features in a data set increase. Therefore, to identify the optimal feature combinations, contemporary optimization techniques are used. Numerous optimization problems have been successfully resolved using the innovative metaheuristic known as the marine predators algorithm (MPA). Support vector machines (SVMs) are a crucial technique that is expertly applied to classification issues. In this work, the issue of feature picking in large dimensional data sets is solved by adjusting the MPA using the SVM as a classifier. In order to address the problem of feature selection in large dimensional data sets, the current study suggests MPA + SVM. Ten high-dimensional data sets got from the Arizona State University (ASU) source were employed to prove the usefulness of the planned method; the outcomes are likened with those of the additional six cutting-edge picking features algorithms. We compared the following algorithms: atom search optimization (ASO), satin bowerbird optimizer (SBO), emperor penguin optimizer (EPO), equilibrium optimizer (EO), monarch butterfly optimization (MBO), and sine cosine algorithm (SCA). The consequences confirm that the planned MPA+SVM approach outperformed several metaheuristic algorithms and presented a remarkable capability to pick the utmost weighty and optimum features. MPA + SVM yields the lowermost averaged error rates, minimal classification standard deviation (STD) values, and FS rates across all data sets.

Aerodynamic shape optimisation technology is presented, comprising an efficient variable fidelity shape parameterisation method, an efficient andhigh quality mesh deformation scheme, and a parallel optimisation algorithm. The objective of the research presented here is the comparison of truly three-dimensional optimisations of aircraft wings in both aerodynamic and aeroelastic environments. The novel shape parameterisation technique allows various fidelities of design parameters, ranging from detailed surface changes to novel truly three-dimensional planform adjustments. An efficient interpolation scheme, using radial basis functions, transfers domain element movements into direct deformations of the design surface and corresponding CFD mesh, thus allowing total independence from the grid generation package and type (structured or unstructured). Optimisation is independent from the CFD flow solver by obtaining sensitivity information for an advanced parallel gradient-based optimiser by finite-differences. This ‘wrap-around’ optimisation technique is applied to a modern large transport aircraft wing in the cruise flight condition for minimum drag with stringent constraints in lift, volume, and two root moments. The objective of all optimisations is aerodynamic, however the static aeroelastic deflection provided by an aeroelastic solver will give that particular optimisation increased accuracy and real world relevance. The result of a constrained inviscid aerodynamic optimisation is presented and has a significant reduction in drag when compared to the initial wing with no violation of any constraints. The shape parameterisation method demonstrates that only a low number of design variables are necessary to achieve innovative planform and surface geometries with dramatically improved performance. Computational fluid dynamics (CFD) methods are now commonplace in aerospace industries, and at the forefront of analysis capabilities, providing a fast and effective method of predicting a design’s aerodynamic performance. However, with ever increasing complexity of designs, engineers can often struggle to interpret the intricacies of the CFD results sufficiently to be able to manually alter the geometry to improve performance. Hence, there has been an increase in demand for intelligent and automatic shape optimisation schemes. This requires combining geometry control methods with numerical optimisation algorithms, to provide a mechanism to mathematically seek improved and optimum designs, using CFD as the analysis tool. Optimisation requires consideration of three issues, each of which have numerous solutions: shape parameterisation including CFD surface and volume mesh deformation, computation of design variable derivatives, and effective use of these derivatives to improve design. Geometry parameterisation is critical for effective shape optimisation. This is the method of representing the design surface, and defines the degrees of freedom in which the geometry can be altered and, ideally, this should be linked with an effective method of deforming the CFD surface and volume mesh in a corresponding fashion. Parameterising complex shapes is a problem that remains a serious obstacle to both manual and automatic CFD-based optimisation. A wide variety of shape control and morphing methods have been developed, but many do not allow sufficiently

Marine Predators Algorithm (MPA) is a recent efficient metaheuristic algorithm that is enlightened by the biological behavior of ocean predators and prey. This algorithm simulates the Levy and Brownian movements of prevalent foraging strategy and has been applied to many complex optimization problems. However, the algorithm has defects such as a low diversity of the solutions, ease into the local optimal solutions, and decreasing convergence speed in dealing with complex problems. A modified version of this algorithm called ODMPA is proposed based on the tent map, the outpost mechanism, and the differential evolution mutation with simulated annealing (DE-SA) mechanism. The tent map and DE-SA mechanism are added to enhance the exploration capability of MPA by increasing the diversity of the search agents, and the outpost mechanism is mainly used to improve the convergence speed of MPA. To validate the outstanding performance of the ODMPA, a series of global optimization problems are selected as the test sets, including the standard IEEE CEC2014 benchmark functions, which are the authoritative test set, three well-known engineering problems, and photovoltaic model parameters tasks. Compared with some famous algorithms, the results reveal that ODMPA has achieved better performance than its counterparts in CEC2014 benchmark functions. And in solving real-world optimization problems, ODMPA could get higher accuracy than other metaheuristic algorithms. These practical results demonstrate that the mechanisms introduced positively affect the original MPA, and the proposed ODMPA can be a widely effective tool in tackling many optimization problems.

Proton Exchange Membrane Fuel Cells (PEMFC) is considered a propitious solution for an environmentally friendly energy source. A precise model of PEMFC for accurate identification of its polarization curve and an in-depth understanding of all its operating characteristics attracted the interest of many researchers. In this paper, recent meta-heuristic optimization methods have been successfully applied to evaluate the unknown parameters of PEMFC models, particularly Marine Predators Algorithm (MPA) and Political Optimizer (PO) techniques. The proposed optimization algorithms have been tested on three different commercial PEMFC stacks, namely BCS 500-W, SR-12PEM 500 W, and 250 W stack under various operating conditions. The sum of square errors (SSE) between the results obtained by the application of the estimated parameters and the experimentally measured results of the fuel cell stacks was considered as the objective function of the optimization problem. In order to validate the effectiveness of the proposed methods, the results are compared with those obtained in the literature. Moreover, the I/V curves obtained by the application of MPA and PO showed a clear matching with datasheet curves for all the studied cases. Statistical analysis has been performed to evaluate the robustness of the MPA and PO techniques. Finally, the PEMFC model based on the MPA technique surpasses all compared algorithms in terms of the solution accuracy and the convergence speed. The obtained results confirmed the superiority and reliability of the applied approach of the MPA algorithm. The results prove that the MPA algorithm has a superior performance based on its reliability.

Multi-objective free-form optimization for shape and thickness of shell structures with composite materials

Multi-strategy enhanced Marine Predators Algorithm with applications in engineering optimization and feature selection problems

SHAPE ANALYSIS AND OPTIMIZATION IN DISTRIBUTED PARAMETER SYSTEMS

Shape optimization of automotive body frame using an improved genetic algorithm optimizer

3R25. Shape Optimization by the Homogenization Method. Applied Mathematical Sciences, Vol 146. - G Allaire (Center of Appl Math, Ecole Polytechnic, Paliseau Cedex, 91128, France). Springer-Verlag, New York. 2002. 456 pp. ISBN 0-387-95298-5. $79.95.Reviewed by MS Qatu (Ford Motor Co, EVB Bldg, MD X8, 20800 Oakwood Blvd, Dearborn MI 48124).This is mainly a research monograph on the theory and application of the homogenization method in shape optimization problems. Applications given in the book are in the fields of composite materials, conductivity, and elasticity with emphasis on the minimization of compliance. The audience for this book includes researchers and advanced graduate students in applied mathematics and engineers interested in the design of shapes of structures for conductive and elastic purposes. It also fits very well for material scientists with inclination towards theoretical aspects of design and analysis of composite materials. Based on the theoretical content and examples in the book, the word shape in the title should rather be understood as topology. In some engineering fields, shape is more related to boundary perturbation, however, the methods presented in this book are designed to define the boundary, rather than to perturb it. This concept of defining the boundary is closer to the idea of topology optimization as a material distribution problem. The book is divided into five chapters. The first chapter covers the subject of homogenization in quite details. Periodicity is first assumed and used to derive homogenized operators in elasticity by means of the two-scale asymptotic expansion. Definitions and proofs of H- and G-convergence are then presented in a rigorous way. The second chapter is titled mathematical modeling of composite materials. In this chapter, Allaire explains carefully the G-closure problem and its interpretations in the mechanical setting. Finding bounds on elastic properties of bi-phase materials is an old problem in mechanics that can be explained and treated mathematically with the help of the G-closure theory. Rank laminated materials are used to demonstrate the bounds derived in the book. Optimal design of materials under electric conductivity considerations is addressed in the third chapter. With an extensive number of proofs, this chapter explains the theory behind the computation of optimal topology (shape) using homogenization theory as a mean to relax the optimization problem. Composite materials are used to relax the problem, and homogenization of conductivity tensors is then used to go from an ill-posed problem to a well-posed one. Structural optimization has been an important subject of research since the days of Lagrange and Saint Venant. This chapter is the counterpart of the previous one, this time, in the field of elastic structures. Composite materials are again introduced to relax the optimization problem and homogenized elastic properties are computed in order to attain a solution to the problem. The minimization of compliance (maximization of stiffness) is addressed intensively in this chapter. The fifth and last chapter is titled Numerical Algorithms. Academic two-dimensional rectangular domains using quadrilateral elements in regular meshes are used to exemplify the theory presented in the previous chapters. Examples include minimization of compliance and maximization of eigenvalues. Multiple loadings and optimum topologies (shapes) of complaint mechanisms were considered. In summary, Shape Optimization by the Homogenization Method is an excellent book that complements very well the extensive literature in the field, including Sanchez-Palencia and Zaoui [1], Bendsøe [2], Cherkaev [3], and Bendsøe and Sigmund [4].

Two approaches are proposed for solving inverse problems in shape optimization. We are looking for the unknown position of a small hole in a domain Ω. First, the asymptotic analysis of the underlying p.d.e. defined in a perturbed domain is performed and the so-called topological derivative is defined. Then, in the first approach, the self-adjoint extensions of elliptic operators are used to model the solution of a partial differential equation defined in the singularly perturbed domain. A least-square functional is then minimized to identify the hole. In the second approach, neural networks are used to determine the inverse of the mapping which associates a set of shape functionals to the position of the unknown hole. In both approaches the topological derivatives are used to approximate the shape functionals.

This study presents an advanced metaheuristic approach termed the Enhanced Gorilla Troops Optimizer (EGTO), which builds upon the Marine Predators Algorithm (MPA) to enhance the search capabilities of the Gorilla Troops Optimizer (GTO). Like numerous other metaheuristic algorithms, the GTO encounters difficulties in preserving convergence accuracy and stability, notably when tackling intricate and adaptable optimization problems, especially when compared to more advanced optimization techniques. Addressing these challenges and aiming for improved performance, this paper proposes the EGTO, integrating high and low-velocity ratios inspired by the MPA. The EGTO technique effectively balances exploration and exploitation phases, achieving impressive results by utilizing fewer parameters and operations. Evaluation on a diverse array of benchmark functions, comprising 23 established functions and ten complex ones from the CEC2019 benchmark, highlights its performance. Comparative analysis against established optimization techniques reveals EGTO's superiority, consistently outperforming its counterparts such as tuna swarm optimization, grey wolf optimizer, gradient based optimizer, artificial rabbits optimization algorithm, pelican optimization algorithm, Runge Kutta optimization algorithm (RUN), and original GTO algorithms across various test functions. Furthermore, EGTO's efficacy extends to addressing seven challenging engineering design problems, encompassing three-bar truss design, compression spring design, pressure vessel design, cantilever beam design, welded beam design, speed reducer design, and gear train design. The results showcase EGTO's robust convergence rate, its adeptness in locating local/global optima, and its supremacy over alternative methodologies explored.

The shape optimization problems naturally appear in engineering and biology. They aim to answer questions as:-What a perfect wing may look like?-How to minimize the resistance of a moving object in a gas or a fluid?-How to build a rod of maximal rigidity?-What is the behaviour of a system of cells?The shape optimization appears also in physics, mainly in electrodynamics and in the systems presenting both classical and quantum mechanics behaviour. For explicit examples and furtheraccount on the applications of the shape optimization we refer to the books [20] and [69]. Here we deal with the theoretical mathematical aspects of the shape optimization, concerning existence of optimal sets and their regularity. In all the practical situations above, the shape of the object in study is determined by a functional depending on the solution of a given partial differential equation. We will sometimes refer to this function as a state function.The simplest state functions are provided by solutions of the equations−∆w = 1 and −∆u = λu,which usually represent the torsion rigidity and the oscillation modes of a given object. Thus our study will be concentrated mainly on the situations, in which these state functions appear,i.e. when the optimality is intended with respect to energy and spectral functionals. [20] D. Bucur, G. Buttazzo: Variational Methods in Shape Optimization Problems. Progress in Nonlinear Differential Equations 65, Birkhauser Verlag, Basel (2005).[69] A. Henrot, M. Pierre: Variation et optimisation de formes: une analyse geometrique. Springer-Berlag, Berlin, 2005.

Flexible AC transmission systems (FACTS) and optimal power-flow (OPF) solutions play an important role in solving power operation problems. The volatile nature of the power generation profiles from renewable energy sources, solar and wind systems, and determining the optimal locations and sizes of FACTS devices increase the complexity of the OPF problems in modern power network models, such as transmission power loss, power generation operation cost and voltage deviation, as a highly nonlinear-nonconvex optimization problem. Therefore, this article introduces and employs four new independent, reliable and efficient optimization algorithms inspired by nature and biological nature, namely: Slime Mould Algorithm (SMA), Artificial Ecosystem-based Optimization (AEO), Marine Predators Algorithm (MPA) and Jellyfish Search (JS), for solving both multi- and single-OPF objective problems for a power network incorporating FACTS and stochastic renewable energy sources. The proposed new metaheuristic optimization techniques are compared to the common and available alternatives in the literature, Particle Swarm Optimization (PSO), Moth Flame Optimization (MFO) and Grey Wolf Optimizer (GWO), using IEEE 30-bus test system. To consider and address the challenges of the OPF in modern power network models, the proposed optimization techniques tested under different operation cases such as an increasing in the load, with and without FCTAS and renewable energy sources, different renewable energy sources locations on the network. The result showed that the MPA, SMA, JS and AEO algorithms are more effective solvers for the OPF problems cases compared to the PSO, GWO and MFO algorithms. For example, the AEO obtained 0.0844 p.u. in case of minimizing the voltage deviation compared to 0.1155 p.u. for PSO, which means that the AEO algorithm improved the voltage deviation term by 27% compared to the PSO algorithm.

This chapter is the printed matter of a series of lectures on shape optimization given in Udine (Italy) in June 2012. It is mainly focused on the optimal design problem in elasticity.It is well known, since the pioneer work of Tartar and Murat in the late 70’s, that this problem – as well as the scalar shape optimization problem in conductivity – is ill posed and does not always admit solutions. If the goal is to construct numerical methods to address this optimal design problem, this illposedness will lead to algorithms showing instabilities and erratic behaviours.Two ways are possible to slightly change the initial problem so that it may be solved in an efficient and reliable way by numerical methods. The first one consists in enlarging the set of admissible shapes and allow, as solutions, “generalized shapes” that may contain fine mixtures of the initial material and void. This process is called “relaxation” and the main mathematical tool involved is the homogenization theory. It leads to the so called “homogenization method for shape optimization”. It is described in Section 2, both from theoretical and numerical point of views, including practical issues necessary to write a numerical code.The second approach consists in restricting the set of admissible solutions. A few theorems prove the existence of solutions under further geometrical, topological or regularity constraints. The classical domain variation method is revisited using the level set representation, that may be seen as a constraint on the set of admissible solutions. The main tool is here the shape derivative. The level set algorithm is presented in Section 3.Of course this chapter is too short to develop new results and methods and present extensive proofs. Its goal is rather to give an overview on different parts of our work on this topics. Interested readers should check the references cited to have further details.KeywordsTopology OptimizationShape OptimizationHomogenization MethodAdmissible SolutionOptimal Design ProblemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Shape and size optimization problems instructural design are addressed using the particle swarm optimization algorithm (PSOA). In our implementation of the PSOA, the social behaviour of birds is mimicked. Individual birds exchange information about their position, velocity and fitness, and the behaviour of the flock is then influenced to increase the probability of migration to regions of high fitness. New operators in the PSOA, namely the elite velocity and the elite particle, are introduced.