Approximated Unimodal Region Elimination Based Global Optimization Method for Engineering Design

<div class="section abstract"><div class="htmlview paragraph">Plenum system of automotive vehicles draws atmospheric air using HVAC blower motor through air inlet grille at the bottom of the windshield and uses lower plenum for rainwater drainage after which air flow enters into awning and sugar scoop for evaporator air flow requirement. Awning and sugar scoop component is used in plenum air flow system to ensure the air flow with the required velocity that would meet the performance metric of total pressure drop of plenum air flow system. The optimal design of plenum component is essential since blower motor energy needs to be drawn from the expensive battery pack and any wastage of energy would lead to reduction in range of the Electric Vehicle. The conventional design process utilizes incremental design iteration, engineering intuition and requires significant effort from engineers to meet performance targets within the specified design space. This also may or may not ensure an optimal design.</div><div class="htmlview paragraph">In this work, a Machine learning tool with extreme gradient boost algorithm is used for development of a robust meta model that is used for quick prediction of awning and sugar scoop performance parameters such as total pressure drop and velocity of air prediction. On this response surface, application of a meta heuristic [<span class="xref">1</span>] based global optimization method is demonstrated which uses simplex homological global optimization (SHGO) and differential evolutionary (DE) method for optimum awning and sugar scoop design. Simplex homological global optimization (SHGO) is the concept of homology group growth which is used to solve a global and derivative free optimization problem of arbitrarily high dimensions. Similarly Differential evolution (DE) is a population-based metaheuristic search algorithm [<span class="xref">2</span>] that optimizes a problem which can quickly explore very large design spaces. Using these global optimization algorithms, it is observed that the optimized design of the awning and sugar scoop does result in significant reduction of total pressure drop that helps improve the required performance substantially compared to baseline design parameters within the given design space.</div></div>

*† ‡ § An efficient and high-fidelity design approach is proposed by combining global and local optimization methods for wing planform and surface design. For enhanced design results, aerodynamic shape optimization process is carried out via 2-stage with different optimization strategy. In the first stage, global optimization techniques are applied to planform design with a few geometric design variables. In the second stage, local optimization techniques are used for wing surface design with a lot of design variables to maintain a sufficient design space with high DOF (Degree of Freedom) geometric change. For global optimization, meta-modeling techniques such as RS (Response Surface) and Kriging methods are used in conjunction with Genetic Algorithm (GA). For local optimization, a discrete adjoint variable method is used. By the successive combination of global and local optimization techniques, drag minimization is performed for a multi-body aircraft configuration while maintaining the baseline lift and the wing weight at the same time. Through the design process, performances of the test models are remarkably improved in comparison with the single stage design approach. The capability of proposed design framework including wing planform design variables can be evaluated by the drag decomposition method which can provide improvement of induced drag and wave drag, respectively.

Summary Seismic inversion often involves nonlinear relationships between model and data and the misfit function usually has many local minima. Global optimization algorithms are well-known capable to search for the global minimum of a misfit function without requiring a good initial model. However, these algorithms can hardly work for large-dimensional cases because of the “curse of dimensionality” problem. In this paper, we mitigate this problem by introducing a neural network called autoencoder into seismic inversion and propose a new inversion method based on global optimization and autoencoder. Benefiting from the dimensionality reduction characteristics of autoencoder, in the proposed method, the original large-dimensional problem is transformed into a low-dimensional one that can be efficiently optimized by a global optimization algorithm. Preliminary numerical examples demonstrate that the proposed method can solve large-dimensional seismic inversion problem with a significant improvement in efficiency compared with conventional global optimization based method.

Multi-vessel formation shipping demonstrates significant potential for enhancing maritime transportation efficiency and economy. However, existing route planning systems inadequately address the unique challenges of formations, where traditional methods fail to integrate global optimality, local dynamic obstacle avoidance, and formation coordination into a cohesive system. Global planning often neglects multi-ship collaborative constraints, while local methods disregard vessel maneuvering characteristics and formation stability. This paper proposes GLFM, a three-layer hierarchical framework (global optimization–local adjustment-formation collaboration module) for intelligent route planning of transport ship formations. GLFM integrates an improved multi-objective A* algorithm for global path optimization under dynamic meteorological and oceanographic (METOC) conditions and International Maritime Organization (IMO) safety regulations, with an enhanced Artificial Potential Field (APF) method incorporating ship safety domains for dynamic local obstacle avoidance. Formation, structural stability, and coordination are achieved through an improved leader–follower approach. Simulation results demonstrate that GLFM-generated trajectories significantly outperform conventional routes, reducing average risk level by 38.46% and voyage duration by 12.15%, while maintaining zero speed and period violation rates. Effective obstacle avoidance is achieved, with the leader vessel navigating optimized global waypoints and followers maintaining formation structure. The GLFM framework successfully balances global optimality with local responsiveness, enhances formation transportation efficiency and safety, and provides a comprehensive solution for intelligent route optimization in multi-constrained marine convoy operations.

In this work, optimization methodologies of the kinematics of flapping wings in forward and hover flights are considered. Particularly, local and global optimization algorithms are combined with the unsteady vortex lattice method (UVLM) to determine the most efficient kinematics. In the first problem, the kinematic optimization of a three-dimensional flapping wing in forward flight with active shape morphing is aimed at maximizing the propulsive efficiency under lift and thrust constraints. Results show that due to the quasi-concavity of the objective function associated with the flapping kinematics employed in forward flight, local gradient-based optimizers perform very well in terms of accuracy and computational cost. In the second problem, the objective is to identify the optimized kinematics of a twodimensional hovering wing that minimize the aerodynamic power under lift constraint. The results show that using a hybrid optimization algorithm (combination of local and global schemes) accelerates the convergence to optimal points and avoids being trapped at local minimum points. While the efficiency of using a local optimizer, a global optimizer, or a hybrid of the two depends on the nature of the problem and associated design space, it is determined that hybrid optimization is best suited for determining local minima.

An environment for general research into and prototyping of algorithms for reliable constrained and unconstrained global nonlinear optimization and reliable enclosure of all roots of nonlinear systems of equations, with or without inequality constraints, is being developed. This environment should be portable, easy to learn, use, and maintain, and sufficiently fast for some production work. The motivation, design principles, uses, and capabilities for this environment are outlined. The environment includes an interval data type, a symbolic form of automatic differentiation to obtain an internal representation for functions, a special technique to allow conditional branches with operator overloading and interval computations, and generic routines to give interval and noninterval function and derivative information. Some of these generic routines use a special version of the backward mode of automatic differentiation. The package also includes dynamic data structures for exhaustive search algorithms.

A reconsideration on the resolution of phase stability analysis using stochastic global optimization methods: Proposal of a reliable set of benchmark problems

Global optimization has been an area of active research for the past few decades. There are many different global optimization algorithms that have been proposed and studied. Among these, differential evolution (DE) is a promising population‐based stochastic global optimization algorithm. It has been gaining popularity in the recent past due to its capability to handle non‐convex, non‐differentiable and multimodal objective functions. In this work, a hybrid global optimization (HGO) method with a novel stopping criterion is proposed. The proposed algorithm integrates DE with a taboo list of taboo search and self‐adaptive strategies. The taboo list/check prevents revisiting the same area, thus increasing the population diversity and computational efficiency. The self‐adaptive strategy reduces the algorithm parameters to be provided and makes the algorithm more robust. Furthermore, a novel stopping criterion based on the number of rejected points is developed. The effectiveness of the proposed stopping criterion and HGO is assessed on more than 30 benchmark problems with 2–30 variables. The performance of HGO is compared with some state‐of‐the‐art global optimization algorithms recently published in the literature. The results show that the reliability of finding the global optimum by HGO is slightly better than that by the latest DE techniques in the literature, and the number of function evaluations (NFE) of HGO is significantly reduced. Finally, HGO is tested for parameter estimation in dynamic models. In conclusion, the proposed HGO algorithm with the novel stopping criterion is found to be reliable, efficient and suitable for application problems. Copyright © 2011 Curtin University of Technology and John Wiley & Sons, Ltd.

MEMPSODE: A global optimization software based on hybridization of population-based algorithms and local searches

Universal machine learning interatomic potentials (uMLIPs) have recently been formulated and shown to generalize well. When applied out-of-sample, further data collection for improvement of the uMLIPs may, however, be required. In this work we demonstrate that, whenever the envisaged use of the MLIPs is global optimization, the data acquisition can follow an active learning scheme in which a gradually updated uMLIP directs the finding of new structures, which are subsequently evaluated at the density functional theory (DFT) level. In the scheme, we augment foundation models using a Δ-model based on this new data using local SOAP-descriptors, Gaussian kernels, and a sparse Gaussian process regression model. We compare the efficacy of the approach with different global optimization algorithms, random structure search, basin hopping, a Bayesian approach with competitive candidates (GOFEE), and a replica exchange formulation (REX). We further compare several foundation models, CHGNet, MACE-MP0, and MACE-MPA. The test systems are silver-sulfur clusters and sulfur-induced surface reconstructions on Ag(111) and Ag(100). Judged by the fidelity of identifying global minima, active learning with GPR-based Δ-models appears to be a robust approach. Judged by the total CPU time spent, the REX approach stands out as being the most efficient.

Aircraft manufacturing companies have to consider multiple derivatives to satisfy various market requirements. They modify or extend an existing aircraft to meet the new market demands while keeping the development time and the cost to a minimum. Many researchers have studied the derivative design process, but these research considered the baseline and the derivatives together, while using the whole set of design variables. Therefore, an efficient process that can reduce the cost and the time for the aircraft derivative design is needed. In this dissertation, Aircraft Derivative Design Optimization process (ADDOPT) was developed which obtains the global changes from the local changes in the aircraft design to develop the aircraft derivatives efficiently. The sensitivity analysis was implemented to ignore design variables that have low impact on the objective function. This avoids wasting computational effort and time on low priority variables for design requirements and objectives. Additionally, the classification of uncertainty from its characteristics and sources of uncertainty involved in the aircraft design process were suggested to consider with design optimization. Uncertainty from the fidelity of analysis tools was applied in design optimization to increase the probability of optimization results. To handle uncertainty in low fidelity analysis tools on aircraft conceptual design optimization, Reliability Based Design Optimization (RBDO) and Possibility Based Design Optimization (PBDO) methods were performed. In this research, Extended Fourier Amplitude Sensitivity Test (eFAST) method was implemented in ADDOPT for Global Sensitivity Analysis (GSA) method and Collaborative Optimization (CO) based framework with RBDO and PBDO were also used. These methods were evaluated using numerical examples. ADDOPT was carried through on the civil jet aircraft derivative design. The objective of the optimization problem was to increase cruise range while satisfying the requirement such as the number of passengers. The proposed process reduced computation effort by reducing the number of design variables and achieved the target probability of failure when considering uncertainty from low fidelity analysis tools.

Abstract: Inversion of self-potential anomaly for 2-D inclined sheets of infinite horizontal extent has been studied. Least-square inversion and very fast simulated annealing global optimization has been used to model the five parameters of self potential anomaly. The method of least square and very fast simulated annealing global optimization method is compared and analyzed. Very fast simulated annealing can model the noisy and field data of self potential anomaly very precisely than linear inversion technique. However, time taken by very fast simulated annealing inversion is larger than linearized inversion. The comparative analysis has been done on synthetic data (noise free and noisy) and two field data from Bavarian woods anomaly, Germany and Surda anomaly, India to show the efficacy of both the methods. The estimated parameters were compared with those from previous studies using various global optimization algorithms, mainly neural network, genetic algorithm and particle swarm optimization on the same field data sets. It can be concluded that the global optimization algorithms considered in this study were able to yield compatible solutions with those from least-square methods. The present global optimization method is in good agreement with the other global optimization methods in terms of results and computation time.

Global optimisation problems in high-dimensional and infinite-dimensional spaces arise in various real-world applications such as engineering, economics and finance, geophysics, biology, machine learning, optimal control, etc. Among stochastic approaches to global optimisation, biology-inspired methods are currently very popular in the literature. Bio-inspired approaches imitate natural ecological and evolutionary processes and are reported to be efficient in a large number of practical study cases. However, many bio-inspired methods can possess some vital drawbacks. For example, due to their semi-empirical nature, convergence to the globally optimal solution cannot always be guaranteed. Another major obstacle is that the existing methods often struggle with higher dimensionality of the space of parameters, which results in a slow convergence. Moreover, it is often difficult to adjust the dimensionality of the space of parameters in the corresponding computer code for a practical realisation of the optimisation method. Here, we present a bio-inspired global stochastic optimisation method applicable in Hilbert function spaces. The proposed method is an evolutionary algorithm inspired by the Darwin’s famous idea of survival of the fittest and is, therefore, referred to as the ‘Survival of the Fittest Algorithm’ (SoFA). Mathematically, the convergence of SoFA is a consequence of the fundamental property of localisation of probabilistic measure in a Hilbert space and we rigorously prove the convergence of the introduced algorithm for a generic class of functionals. The approach is simple in terms of practical coding. As an insightful, real-world problem, we apply our method to find the globally optimal trajectory for the daily vertical migration of zooplankton in the ocean and lakes, this phenomenon is considered to be the largest synchronised movement of biomass on Earth. We maximise fitness in a function space derived from a von-Foerster stage-structured population model with biologically realistic parameters. We show that for problems of fitness maximisation in high-dimensional spaces, SoFA provides better performance as compared to some other stochastic global optimisation algorithms. We highlight the links between the new optimisation algorithm and natural selection processes in ecosystems occurring within a population via gradual exclusion of competitive con-specific strains.

Particle Swarm Optimization with Sequential Niche Technique for Dynamic Finite Element Model Updating

Parallel radial basis function methods for the global optimization of expensive functions