Engineering Computations最新文献

Purpose

Metaheuristic algorithms based on biology, evolutionary theory and physical principles, have been widely developed for complex global optimization. This paper aims to present a new hybrid optimization algorithm that combines the characteristics of biogeography-based optimization (BBO), invasive weed optimization (IWO) and genetic algorithms (GAs).

Design/methodology/approach

The significant difference between the new algorithm and original optimizers is a periodic selection scheme for offspring. The selection criterion is a function of cyclic discharge and the fitness of populations. It differs from traditional optimization methods where the elite always gains advantages. With this method, fitter populations may still be rejected, while poorer ones might be likely retained. The selection scheme is applied to help escape from local optima and maintain solution diversity.

Findings

The efficiency of the proposed method is tested on 13 high-dimensional, nonlinear benchmark functions and a homogenous slope stability problem. The results of the benchmark function show that the new method performs well in terms of accuracy and solution diversity. The algorithm converges with a magnitude of 10-4, compared to 102 in BBO and 10-2 in IWO. In the slope stability problem, the safety factor acquired by the analogy of slope erosion (ASE) is closer to the recommended value.

Originality/value

This paper introduces a periodic selection strategy and constructs a hybrid optimizer, which enhances the global exploration capacity of metaheuristic algorithms.

Purpose

In the present work, we focus on developing an in-house parallel meshless local Petrov-Galerkin (MLPG) code for the analysis of heat conduction in two-dimensional and three-dimensional regular as well as complex geometries.

Design/methodology/approach

The parallel MLPG code has been implemented using open multi-processing (OpenMP) application programming interface (API) on the shared memory multicore CPU architecture. Numerical simulations have been performed to find the critical regions of the serial code, and an OpenMP-based parallel MLPG code is developed, considering the critical regions of the sequential code.

Findings

Based on performance parameters such as speed-up and parallel efficiency, the credibility of the parallelization procedure has been established. Maximum speed-up and parallel efficiency are 10.94 and 0.92 for regular three-dimensional geometry (343,000 nodes). Results demonstrate the suitability of parallelization for larger nodes as parallel efficiency and speed-up are more for the larger nodes.

Originality/value

Few attempts have been made in parallel implementation of the MLPG method for solving large-scale industrial problems. Although the literature suggests that message-passing interface (MPI) based parallel MLPG codes have been developed, the OpenMP model has rarely been touched. This work is an attempt at the development of OpenMP-based parallel MLPG code for the very first time.

Purpose

This study aims to apply for the first time in literature a new multi-objective sensor selection and placement optimization methodology based on the multi-objective Lichtenberg algorithm and test the sensors' configuration found in a delamination identification case study.

Design/methodology/approach

This work aims to study the damage identification in an aircraft wing using the Lichtenberg and multi-objective Lichtenberg algorithms. The former is used to identify damages, while the last is associated with feature selection techniques to perform the first sensor placement optimization (SPO) methodology with variable sensor number. It is applied aiming for the largest amount of information about using the most used modal metrics in the literature and the smallest sensor number at the same time.

Findings

The proposed method was not only able to find a sensor configuration for each sensor number and modal metric but also found one that had full accuracy in identifying delamination location and severity considering triaxial modal displacements and minimal sensor number for all wing sections.

Originality/value

This study demonstrates for the first time in the literature how the most used modal metrics vary with the sensor number for an aircraft wing using a new multi-objective sensor selection and placement optimization methodology based on the multi-objective Lichtenberg algorithm.

Purpose

Bayesian cubature (BC) has emerged to be one of most competitive approach for estimating the multi-dimensional integral especially when the integrand is expensive to evaluate, and alternative acquisition functions, such as the Posterior Variance Contribution (PVC) function, have been developed for adaptive experiment design of the integration points. However, those sequential design strategies also prevent BC from being implemented in a parallel scheme. Therefore, this paper aims at developing a parallelized adaptive BC method to further improve the computational efficiency.

Design/methodology/approach

By theoretically examining the multimodal behavior of the PVC function, it is concluded that the multiple local maxima all have important contribution to the integration accuracy as can be selected as design points, providing a practical way for parallelization of the adaptive BC. Inspired by the above finding, four multimodal optimization algorithms, including one newly developed in this work, are then introduced for finding multiple local maxima of the PVC function in one run, and further for parallel implementation of the adaptive BC.

Findings

The superiority of the parallel schemes and the performance of the four multimodal optimization algorithms are then demonstrated and compared with the k-means clustering method by using two numerical benchmarks and two engineering examples.

Originality/value

Multimodal behavior of acquisition function for BC is comprehensively investigated. All the local maxima of the acquisition function contribute to adaptive BC accuracy. Parallelization of adaptive BC is realized with four multimodal optimization methods.

Purpose

The purpose of this paper is to exploit the multiple-Toeplitz matrices reconstruction method combined with quadratic spatial smoothing processing to improve the direction-of-arrival (DOA) estimation performance of coherent signals at low signal-to-noise ratio (SNRs).

Design/methodology/approach

An improved multiple-Toeplitz matrices reconstruction method is proposed via quadratic spatial smoothing processing. Our proposed method takes advantage of the available information contained in the auto-covariance matrices of individual Toeplitz matrices and the cross-covariance matrices of different Toeplitz matrices, which results in a higher noise suppression ability.

Findings

Theoretical analysis and simulation results show that, compared with the existing Toeplitz matrix processing methods, the proposed method improves the DOA estimation performance in cases with a low SNR. Especially for the cases with a low SNR and small snapshot number as well as with closely spaced sources, the proposed method can achieve much better performance on estimation accuracy and resolution probability.

Research limitations/implications

The study investigates the possibility of reusing pre-existing designs for the DOA estimation of the coherent signals. The proposed technique enables achieve good estimation performance at low SNRs.

Practical implications

The paper includes implications for the DOA problem at low SNRs in communication systems.

Originality/value

The proposed method proved to be useful for the DOA estimation at low SNR.

Purpose

This study aims to propose and numerically assess different ways of discretising a very weak formulation of the Poisson problem.

Design/methodology/approach

We use integration by parts twice to shift smoothness requirements to the test functions, thereby allowing low-regularity data and solutions.

Findings

Various conforming discretisations are presented and tested, with numerical results indicating good accuracy and stability in different types of problems.

Originality/value

This is one of the first articles to propose and test concrete discretisations for very weak variational formulations in primal form. The numerical results, which include a problem based on real MRI data, indicate the potential of very weak finite element methods for tackling problems with low regularity.

Purpose

The primary objective of this study is to tackle the enduring challenge of preserving feature integrity during the manipulation of geometric data in computer graphics. Our work aims to introduce and validate a variational sparse diffusion model that enhances the capability to maintain the definition of sharp features within meshes throughout complex processing tasks such as segmentation and repair.

Design/methodology/approach

We developed a variational sparse diffusion model that integrates a high-order L₁ regularization framework with Dirichlet boundary constraints, specifically designed to preserve edge definition. This model employs an innovative vertex updating strategy that optimizes the quality of mesh repairs. We leverage the augmented Lagrangian method to address the computational challenges inherent in this approach, enabling effective management of the trade-off between diffusion strength and feature preservation. Our methodology involves a detailed analysis of segmentation and repair processes, focusing on maintaining the acuity of features on triangulated surfaces.

Findings

Our findings indicate that the proposed variational sparse diffusion model significantly outperforms traditional smooth diffusion methods in preserving sharp features during mesh processing. The model ensures the delineation of clear boundaries in mesh segmentation and achieves high-fidelity restoration of deteriorated meshes in repair tasks. The innovative vertex updating strategy within the model contributes to enhanced mesh quality post-repair. Empirical evaluations demonstrate that our approach maintains the integrity of original, sharp features more effectively, especially in complex geometries with intricate detail.

Originality/value

The originality of this research lies in the novel application of a high-order L₁ regularization framework to the field of mesh processing, a method not conventionally applied in this context. The value of our work is in providing a robust solution to the problem of feature degradation during the mesh manipulation process. Our model’s unique vertex updating strategy and the use of the augmented Lagrangian method for optimization are distinctive contributions that enhance the state-of-the-art in geometry processing. The empirical success of our model in preserving features during mesh segmentation and repair presents an advancement in computer graphics, offering practical benefits to both academic research and industry applications.

Purpose

In this paper, improvements in reducing transmitted accelerations in a full vehicle are obtained by optimizing the gain parameters of an active control in a roughness road profile.

Design/methodology/approach

For a classically designed linear quadratic regulator (LQR) control, the vibration attenuation performance will depend on weighting matrices Q and R. A methodology is proposed in this work to determine the optimal elements of these matrices by using a genetic algorithm method to get enhanced controller performance. The active control is implemented in an eight degrees of freedom (8-DOF) vehicle suspension model, subjected to a standard ISO road profile. The control performance is compared against a controlled system with few Q and R parameters, an active system without optimized gain matrices, and an optimized passive system.

Findings

The control with 12 optimized parameters for Q and R provided the best vibration attenuation, reducing significantly the Root Mean Square (RMS) accelerations at the driver’s seat and car body.

Research limitations/implications

The research has positive implications in a wide class of active control systems, especially those based on a LQR, which was verified by the multibody dynamic systems tested in the paper.

Practical implications

Better active control gains can be devised to improve performance in vibration attenuation.

Originality/value

The main contribution proposed in this work is the improvement of the Q and R parameters simultaneously, in a full 8-DOF vehicle model, which minimizes the driver’s seat acceleration and, at the same time, guarantees vehicle safety.

Purpose

Hexahedral meshing is one of the most important steps in performing an accurate simulation using the finite element analysis (FEA). However, the current hexahedral meshing method in the industry is a nonautomatic and inefficient method, i.e. manually decomposing the model into suitable blocks and obtaining the hexahedral mesh from these blocks by mapping or sweeping algorithms. The purpose of this paper is to propose an almost automatic decomposition algorithm based on the 3D frame field and model features to replace the traditional time-consuming and laborious manual decomposition method.

Design/methodology/approach

The proposed algorithm is based on the 3D frame field and features, where features are used to construct feature-cutting surfaces and the 3D frame field is used to construct singular-cutting surfaces. The feature-cutting surfaces constructed from concave features first reduce the complexity of the model and decompose it into some coarse blocks. Then, an improved 3D frame field algorithm is performed on these coarse blocks to extract the singular structure and construct singular-cutting surfaces to further decompose the coarse blocks. In most modeling examples, the proposed algorithm uses both types of cutting surfaces to decompose models fully automatically. In a few examples with special requirements for hexahedral meshes, the algorithm requires manual input of some user-defined cutting surfaces and constructs different singular-cutting surfaces to ensure the effectiveness of the decomposition.

Findings

Benefiting from the feature decomposition and the 3D frame field algorithm, the output blocks of the proposed algorithm have no inner singular structure and are suitable for the mapping or sweeping algorithm. The introduction of internal constraints makes 3D frame field generation more robust in this paper, and it can automatically correct some invalid 3–5 singular structures. In a few examples with special requirements, the proposed algorithm successfully generates valid blocks even though the singular structure of the model is modified by user-defined cutting surfaces.

Originality/value

The proposed algorithm takes the advantage of feature decomposition and the 3D frame field to generate suitable blocks for a mapping or sweeping algorithm, which saves a lot of simulation time and requires less experience. The user-defined cutting surfaces enable the creation of special hexahedral meshes, which was difficult with previous algorithms. An improved 3D frame field generation method is proposed to correct some invalid singular structures and improve the robustness of the previous methods.