Real-world Engineering Problems Research Articles

Harmonic Mean Optimizer (HMO) for global problems solving

This study introduces the Harmonic Mean Optimizer (HMO), a novel meta-heuristic algorithm designed to address complex global optimization problems. The primary objective of this research is to develop an optimization technique that effectively balances exploration and exploitation without requiring extensive parameter tuning, thereby simplifying the optimization process and enhancing its robustness across various problem domains. The HMO employs a unique dual-fitness index that leverages the harmonic mean to assess both the quality and diversity of candidate solutions dynamically. This approach ensures a balanced search process that avoids premature convergence and improves the ability to find global optima. The methodology involves extensive benchmarking of the HMO against a comprehensive set of test functions, including 23 traditional functions from the Congress on Evolutionary Computation (CEC) 2017 test suite. The performance of the HMO is compared with that of established meta-heuristic algorithms, such as Genetic Algorithms (GA) and Particle Swarm Optimization (PSO), to validate its efficacy in terms of convergence speed and solution accuracy. Additionally, the HMO is applied to several real-world engineering problems to demonstrate its practical utility. The results show that the HMO consistently outperforms the benchmark algorithms, achieving faster convergence and higher accuracy in finding optimal solutions across a diverse range of test problems. In practical applications, the HMO effectively optimized complex engineering tasks, achieving significant improvements in both solution quality and computational efficiency. These findings highlight the potential of the HMO as a versatile and powerful tool for global optimization tasks. the HMO offers a significant advancement in optimization methodologies by providing a robust, parameter-free approach that effectively balances exploration and exploitation. This study underscores the HMO’s applicability to a wide range of optimization challenges and sets the foundation for future research and development in enhancing and applying this innovative algorithm to more complex and diverse problem domains.

Optimization of Large-Scale Sparse Matrix-Vector Multiplication on Multi-GPU Systems

Sparse matrix-vector multiplication (SpMV) is one of the important kernels of many iterative algorithms for solving sparse linear systems. The limited storage and computational resources of individual GPUs restrict both the scale and speed of SpMV computing in problem-solving. As real-world engineering problems continue to increase in complexity, the imperative for collaborative execution of iterative solving algorithms across multiple GPUs is increasingly apparent. Although the multi-GPU-based SpMV takes less kernel execution time, it also introduces additional data transmission overhead, which diminishes the performance gains derived from parallelization across multi-GPUs. Based on the non-zero elements distribution characteristics of sparse matrices and the trade-off between redundant computations and data transfer overhead, this paper introduces a series of SpMV optimization techniques tailored for multi-GPU environments and effectively enhances the execution efficiency of iterative algorithms on multiple GPUs. Firstly, we propose a two-level non-zero elements-based matrix partitioning method to increase the overlap of kernel execution and data transmission. Then, considering the irregular non-zero elements distribution in sparse matrices, a long-row-aware matrix partitioning method is proposed to hide more data transmissions. Finally, an optimization using redundant and inexpensive short-row execution to exchange costly data transmission is proposed. Our experimental evaluation demonstrates that, compared with the SpMV on a single GPU, the proposed method achieves an average speedup of 2.00x and 1.85x on platforms equipped with two RTX 3090 and two Tesla V100-SXM2, respectively. The average speedup of 2.65x is achieved on a platform equipped with four Tesla V100-SXM2.

A surrogate-assisted a priori multiobjective evolutionary algorithm for constrained multiobjective optimization problems

AbstractWe consider multiobjective optimization problems with at least one computationally expensive constraint function and propose a novel surrogate-assisted evolutionary algorithm that can incorporate preference information given a priori. We employ Kriging models to approximate expensive objective and constraint functions, enabling us to introduce a new selection strategy that emphasizes the generation of feasible solutions throughout the optimization process. In our innovative model management, we perform expensive function evaluations to identify feasible solutions that best reflect the decision maker’s preferences provided before the process. To assess the performance of our proposed algorithm, we utilize two distinct parameterless performance indicators and compare them against existing algorithms from the literature using various real-world engineering and benchmark problems. Furthermore, we assemble new algorithms to analyze the effects of the selection strategy and the model management on the performance of the proposed algorithm. The results show that in most cases, our algorithm has a better performance than the assembled algorithms, especially when there is a restricted budget for expensive function evaluations.

A novel giant pacific octopus optimizer for real-world engineering problem

A novel giant pacific octopus optimizer for real-world engineering problem

Multi-Strategy Improved Dung Beetle Optimization Algorithm and Its Applications.

The dung beetle optimization (DBO) algorithm, a swarm intelligence-based metaheuristic, is renowned for its robust optimization capability and fast convergence speed. However, it also suffers from low population diversity, susceptibility to local optima solutions, and unsatisfactory convergence speed when facing complex optimization problems. In response, this paper proposes the multi-strategy improved dung beetle optimization algorithm (MDBO). The core improvements include using Latin hypercube sampling for better population initialization and the introduction of a novel differential variation strategy, termed "Mean Differential Variation", to enhance the algorithm's ability to evade local optima. Moreover, a strategy combining lens imaging reverse learning and dimension-by-dimension optimization was proposed and applied to the current optimal solution. Through comprehensive performance testing on standard benchmark functions from CEC2017 and CEC2020, MDBO demonstrates superior performance in terms of optimization accuracy, stability, and convergence speed compared with other classical metaheuristic optimization algorithms. Additionally, the efficacy of MDBO in addressing complex real-world engineering problems is validated through three representative engineering application scenarios namely extension/compression spring design problems, reducer design problems, and welded beam design problems.

Learning search algorithm: framework and comprehensive performance for solving optimization problems

In this study, the Learning Search Algorithm (LSA) is introduced as an innovative optimization algorithm that draws inspiration from swarm intelligence principles and mimics the social learning behavior observed in humans. The LSA algorithm optimizes the search process by integrating historical experience and real-time social information, enabling it to effectively navigate complex problem spaces. By doing so, it enhances its global development capability and provides efficient solutions to challenging optimization tasks. Additionally, the algorithm improves the collective learning capacity by incorporating teaching and active learning behaviors within the population, leading to improved local development capabilities. Furthermore, a dynamic adaptive control factor is utilized to regulate the algorithm’s global exploration and local development abilities. The proposed algorithm is rigorously evaluated using 40 benchmark test functions from IEEE CEC 2014 and CEC 2020, and compared against nine established evolutionary algorithms as well as 11 recently improved algorithms. The experimental results demonstrate the superiority of the LSA algorithm, as it achieves the top rank in the Friedman rank-sum test, highlighting its power and competitiveness. Moreover, the LSA algorithm is successfully applied to solve six real-world engineering problems and 15 UCI datasets of feature selection problems, showcasing its significant advantages and potential for practical applications in engineering problems and feature selection problems.

Multi-objective generalized normal distribution optimization: a novel algorithm for multi-objective problems

AbstractThis study introduces the Multi-objective Generalized Normal Distribution Optimization (MOGNDO) algorithm, an advancement of the Generalized Normal Distribution Optimization (GNDO) algorithm, now adapted for multi-objective optimization tasks. The GNDO algorithm, previously known for its effectiveness in single-objective optimization, has been enhanced with two key features for multi-objective optimization. The first is the addition of an archival mechanism to store non-dominated Pareto optimal solutions, ensuring a detailed record of the best outcomes. The second enhancement is a new leader selection mechanism, designed to strategically identify and select the best solutions from the archive to guide the optimization process. This enhancement positions MOGNDO as a cutting-edge solution in multi-objective optimization, setting a new benchmark for evaluating its performance against leading algorithms in the field. The algorithm's effectiveness is rigorously tested across 35 varied case studies, encompassing both mathematical and engineering challenges, and benchmarked against prominent algorithms like MOPSO, MOGWO, MOHHO, MSSA, MOALO, MOMVO, and MOAOS. Utilizing metrics such as Generational Distance (GD), Inverted Generational Distance (IGD), and Maximum Spread (MS), the study underscores MOGNDO's ability to produce Pareto fronts of high quality, marked by exceptional precision and diversity. The results affirm MOGNDO's superior performance and versatility, not only in theoretical tests but also in addressing complex real-world engineering problems, showcasing its high convergence and coverage capabilities. The source codes of the MOGNDO algorithm are publicly available at https://nimakhodadadi.com/algorithms-%2B-codes.

Solution of engineering design and truss topology problems with improved forensic-based investigation algorithm based on dynamic oppositional based learning

The forensic-based investigation (FBI) is a metaheuristic algorithm inspired by the criminal investigation process. The collaborative efforts of the investigation and pursuit teams demonstrate the FBI’s involvement during the exploitation and exploration phases. When choosing the promising population, the FBI algorithm’s population selection technique focuses on the same region. This research aims to propose a dynamic population selection method for the original FBI and thereby enhance its convergence performance. To achieve this objective, the FBI may employ dynamic oppositional learning (DOL), a dynamic version of the oppositional learning methodology, to dynamically navigate to local minima in various locations. Therefore, the proposed advanced method is named DOLFBI. The performance of DOLFBI on the CEC2019 and CEC2022 benchmark functions is evaluated by comparing it with several other popular metaheuristics in the literature. As a result, DOLFBI yielded the lowest fitness value in 18 of 22 benchmark problems. Furthermore, DOLFBI has shown promising results in solving real-world engineering problems. It can be argued that DOLFBI exhibits the best convergence performance in cantilever beam design, speed reducer, and tension/compression problems. DOLFBI is often utilized in truss engineering difficulties to determine the minimal weight. Its success is comparable to other competitive MAs in the literature. The Wilcoxon signed-rank and Friedman rank tests further confirmed the study’s stability. Convergence and trajectory analyses validate the superior convergence concept of the proposed method. When the proposed study is compared to essential and enhanced MAs, the results show that DOLFBI has a competitive framework for addressing complex optimization problems due to its robust convergence ability compared to other optimization techniques. As a result, DOLFBI is expected to achieve significant success in various optimization challenges, feature selection, and other complex engineering or real-world problems.

A novel multi-strategy ameliorated quasi-oppositional chaotic tunicate swarm algorithm for global optimization and constrained engineering applications

Over the last few decades, a number of prominent meta-heuristic algorithms have been put forth to address complex optimization problems. However, there is a critical need to enhance these existing meta-heuristics by employing a variety of evolutionary techniques to tackle the emerging challenges in engineering applications. As a result, this study attempts to boost the efficiency of the recently introduced bio-inspired algorithm, the Tunicate Swarm Algorithm (TSA), which is motivated by the foraging and swarming behaviour of bioluminescent tunicates residing in the deep sea. Like other algorithms, the TSA has certain limitations, including getting trapped in the local optimal values and a lack of exploration ability, resulting in premature convergence when dealing with highly challenging optimization problems. To overcome these shortcomings, a novel multi-strategy ameliorated TSA, termed the Quasi-Oppositional Chaotic TSA (QOCTSA), has been proposed as an enhanced variant of TSA. This enhanced method contributes the simultaneous incorporation of the Quasi-Oppositional Based Learning (QOBL) and Chaotic Local Search (CLS) mechanisms to effectively balance exploration and exploitation. The implementation of QOBL improves convergence accuracy and exploration rate, while the inclusion of a CLS strategy with ten chaotic maps improves exploitation by enhancing local search ability around the most prospective regions. Thus, the QOCTSA significantly enhances convergence accuracy while maintaining TSA diversification. The experimentations are conducted on a set of thirty-three diverse functions: CEC2005 and CEC2019 test functions, as well as several real-world engineering problems. The statistical and graphical outcomes indicate that QOCTSA is superior to TSA and exhibits a faster rate of convergence. Furthermore, the statistical tests, specifically the Wilcoxon rank-sum test and t-test, reveal that the QOCTSA method outperforms the other competing algorithms in the domain of real-world engineering design problems.

Performance improvement of a distributed temperature sensor with kilometer length and centimeter spatial resolution based on polarization-sensitive OFDR

A method to improve the performance of distributed temperature sensors with kilometer sensing distance and centimeter spatial resolution is proposed based on polarization-sensitive optical frequency domain reflectometry (OFDR). This approach records the temperature change along polarization maintaining fiber (PMF) from the Rayleigh backscattering (RBS) spectral difference between two orthogonal polarization axes using the distributed autocorrelation algorithm, where PMF is used as the sensing fiber. In addition, a technique to calibrate population birefringence and local birefringence, and a method to calibrate the initial birefringence inhomogeneity of PMF are proposed to enhance the performance of the sensor. The birefringence of PMF is used for temperature sensing, which is distinct from the traditional cross-correlation method of single-mode optical fiber temperature sensing, providing us with an innovative scheme to solve real-world engineering problems. The final sensing performance is achieved, with a sensing distance of 1.5 km, a spatial resolution of 5 cm, and a temperature measurement uncertainty of ±0.2 °C, subject to environmental noise and system random noise.

An improved multi-strategy Golden Jackal algorithm for real world engineering problems

The Golden Jackal Optimization (GJO) algorithm is a novel, nature-inspired optimization technique that has gained recognition as a highly promising metaheuristic due to its notable efficiency and adaptability. However, the GJO algorithm possesses several shortcomings, including inadequate exploitation ability, vulnerability to local optima, and imbalanced exploration-exploitation. Therefore, this paper presents an enhanced version of the named mGJO, tailored explicitly for addressing real-world engineering and feature selection problems. The mGJO incorporates four improvements to the standard GJO. To begin with, Chaos-OBL (COBL) based population initialization is proposed to increase diversity in population. Secondly, a nonlinear control parameter is proposed to regulate the exploration-exploitation transition. Thirdly, the original updating rule of GJO is combined with the ESQ mechanism to prevent the leader solutions from influencing the local optimal solutions. Finally, a new adaptive mutation strategy is presented to alter individuals and improve positions based on their fitness. To evaluate the efficiency of the suggested mGJO is assessed using CEC2005, CEC2017, CEC2020 and CEC2022 benchmark functions. The proposed mGJO is also applied to five common real-world engineering problems and is also applied to the feature selection problems to assess its performance. Furthermore, the proposed mGJO is compared with various advanced algorithms to evaluate its performance. Statistical analyses, including the Friedman rank test and Wilcoxon test, are applied to the experimental data to validate the superiority of the extracted results. The experimental results and the statistical analysis indicate the superiority of mGJO in terms of convergence rate, solution quality, and optimization accuracy.

Multi-swarm surrogate model assisted PSO algorithm to minimize distribution network energy losses

The computational analysis of real-world engineering problems often relies on time-consuming simulation calculations. This presents challenges in balancing computational burden and precision when applying traditional metaheuristic algorithms to large-scale complex problems. While there have been numerous surrogate-assisted metaheuristic optimization algorithms proposed, most of them are designed for solving expensive problems within 30–50 dimensions. In this paper, a novel approach called Parallel-multi-swarm Gaussian Process Regression surrogate-based particle swarm optimization (Parallel-MS-GPRS-PSO) is proposed for high-dimensional problems. This approach combines a standard particle swarm optimization (PSO) algorithm, multi-swarm cooperative PSO (MSCPSO), and a GPR surrogate-based PSO (PSO-GPR). By integrating PSO-GPR and MSCPSO, the proposed method aims to effectively explore and exploit the search space while enhancing the global and local performance of the surrogate model. To validate the effectiveness of the proposed algorithm, it is compared with several existing PSO algorithms on seven benchmark functions and an engineering problem. The results illustrate that the Parallel-MS-GPRS-PSO approach outperforms the existing algorithms. Moreover, the method shows promising performance in computationally expensive engineering optimization problems with 288 variables.

A Novel Artificial Electric Field Algorithm for Solving Global Optimization and Real-World Engineering Problems.

The Artificial Electric Field Algorithm (AEFA) stands out as a physics-inspired metaheuristic, drawing inspiration from Coulomb's law and electrostatic force; however, while AEFA has demonstrated efficacy, it can face challenges such as convergence issues and suboptimal solutions, especially in high-dimensional problems. To overcome these challenges, this paper introduces a modified version of AEFA, named mAEFA, which leverages the capabilities of Lévy flights, simulated annealing, and the Adaptive s-best Mutation and Natural Survivor Method (NSM) mechanisms. While Lévy flights enhance exploration potential and simulated annealing improves search exploitation, the Adaptive s-best Mutation and Natural Survivor Method (NSM) mechanisms are employed to add more diversity. The integration of these mechanisms in AEFA aims to expand its search space, enhance exploration potential, avoid local optima, and achieve improved performance, robustness, and a more equitable equilibrium between local intensification and global diversification. In this study, a comprehensive assessment of mAEFA is carried out, employing a combination of quantitative and qualitative measures, on a diverse range of 29 intricate CEC'17 constraint benchmarks that exhibit different characteristics. The practical compatibility of the proposed mAEFA is evaluated on five engineering benchmark problems derived from the civil, mechanical, and industrial engineering domains. Results from the mAEFA algorithm are compared with those from seven recently introduced metaheuristic algorithms using widely adopted statistical metrics. The mAEFA algorithm outperforms the LCA algorithm in all 29 CEC'17 test functions with 100% superiority and shows better results than SAO, GOA, CHIO, PSO, GSA, and AEFA in 96.6%, 96.6%, 93.1%, 86.2%, 82.8%, and 58.6% of test cases, respectively. In three out of five engineering design problems, mAEFA outperforms all the compared algorithms, securing second place in the remaining two problems. Results across all optimization problems highlight the effectiveness and robustness of mAEFA compared to baseline metaheuristics. The suggested enhancements in AEFA have proven effective, establishing competitiveness in diverse optimization problems.

Handling noise and overfitting in surrogate models based on non-uniform rational basis spline entities

This paper proposes a general and systematic approach to generate a surrogate model based on non-uniform rational basis spline (NURBS) hyper-surfaces as a solution of a constrained non-linear programming problem, which is solved through a gradient-based algorithm by considering two formulations. The first formulation, which is the general one, is prone to the curse of dimensionality. The second one separates dimensions in the NURBS domain and allows saving computational time and resources. The optimisation process consists of three steps, which are solved sequentially. Each step is characterised by different design variables and solving strategies. The gradient of the cost function, for both formulations and for each optimisation step, is derived analytically by exploiting the properties of NURBS entities, hence enhancing computational efficiency and accuracy. One of the main features of the presented methodology lies the incorporation of a smoothing term in the problem formulation. This term plays a crucial role in controlling overfitting phenomenon and attenuating local oscillations within the dataset. These oscillations may be due to various sources, such as inherent noise, model instabilities, measurement uncertainties, or numerical precision limitations. The effectiveness of the proposed approach is tested on both analytical benchmark problems and real-world engineering problems taken from the literature.

Actively learning costly reward functions for reinforcement learning

Transfer of recent advances in deep reinforcement learning to real-world applications is hindered by high data demands and thus low efficiency and scalability. Through independent improvements of components such as replay buffers or more stable learning algorithms, and through massively distributed systems, training time could be reduced from several days to several hours for standard benchmark tasks. However, while rewards in simulated environments are well-defined and easy to compute, reward evaluation becomes the bottleneck in many real-world environments, e.g. in molecular optimization tasks, where computationally demanding simulations or even experiments are required to evaluate states and to quantify rewards. When ground-truth evaluations become orders of magnitude more expensive than in research scenarios, direct transfer of recent advances would require massive amounts of scale, just for evaluating rewards rather than training the models. We propose to alleviate this problem by replacing costly ground-truth rewards with rewards modeled by neural networks, counteracting non-stationarity of state and reward distributions during training with an active learning component. We demonstrate that using our proposed method, it is possible to train agents in complex real-world environments orders of magnitudes faster than would be possible when using ground-truth rewards. By enabling the application of RL methods to new domains, we show that we can find interesting and non-trivial solutions to real-world optimization problems in chemistry, materials science and engineering. We demonstrate speed-up factors of 50–3000 when applying our approach to challenges of molecular design and airfoil optimization.

Chaos-Enhanced Archimede Algorithm for Global Optimization of Real-World Engineering Problems and Signal Feature Extraction

Optimization algorithms play a crucial role in a wide range of fields, from designing complex systems to solving mathematical and engineering problems. However, these algorithms frequently face major challenges, such as convergence to local optima, which limits their ability to find global, optimal solutions. To overcome these challenges, it has become imperative to explore more efficient approaches by incorporating chaotic maps within these original algorithms. Incorporating chaotic variables into the search process offers notable advantages, including the ability to avoid local minima, diversify the search, and accelerate convergence toward optimal solutions. In this study, we propose an improved Archimedean optimization algorithm called Chaotic_AO (CAO), based on the use of ten distinct chaotic maps to replace pseudorandom sequences in the three essential components of the classical Archimedean optimization algorithm: initialization, density and volume update, and position update. This improvement aims to achieve a more appropriate balance between the exploitation and exploration phases, offering a greater likelihood of discovering global solutions. CAO performance was extensively validated through the exploration of three distinct groups of problems. The first group, made up of twenty-three benchmark functions, served as an initial reference. Group 2 comprises three crucial engineering problems: the design of a welded beam, the modeling of a spring subjected to tension/compression stresses, and the planning of pressurized tanks. Finally, the third group of problems is dedicated to evaluating the efficiency of the CAO algorithm in the field of signal reconstruction, as well as 2D and 3D medical images. The results obtained from these in-depth tests revealed the efficiency and reliability of the CAO algorithm in terms of convergence speeds, and outstanding solution quality in most of the cases studied.

The fully coupled thermo-mechanical dual-horizon peridynamic correspondence damage model for homogeneous and heterogeneous materials

To accurately address the thermally induced dynamic and steady-state crack propagation problems for homogeneous and heterogeneous materials involving crack branching, interfacial de-bonding and crack kinking, we propose the fully coupled thermo-mechanical dual-horizon peridynamic correspondence damage model (TM-DHPD). To this end, the integral coupled equations for TM-DHPD are firstly derived within the framework of thermodynamics. And then, the alternative dual-horizon peridynamic correspondence principle is used to derive the constitutive bond force state, heat flow state and their general linearizations. Moreover, the unified criterion for bond damage is proposed to characterize the internal bond damage in a single material and the interface bond damage in dissimilar materials. To ensure convergence and accuracy, the coupled equations are solved using the standard implicit method without the use of artificial damping. In both homogeneous and heterogeneous materials, some representative and challenging numerical cases are examined, such as dynamic crack branching in a centrally heated disk and multiple interface failure of thermal barrier coating. The numerical results are in good agreement with the available experimental results or the previous predictions, which shows the great potential of the proposed TM-DHPD in addressing the physics of numerous thermally induced fractures in the real-world engineering problems.

Investigating Factors Contributing to Student Disengagement and Ownership in Learning: A Case Study of Undergraduate Engineering Students

Aim/Purpose: Despite playing a critical role in shaping the future, 70% of undergraduate engineers report low levels of motivation. Student disengagement and a lack of ownership of their learning are significant challenges in higher education, specifically engineering students in the computer science department. This study investigates the various causes of these problems among first-year undergraduate engineers. Background: Student disengagement has become a significant problem, especially in higher education, leading to reduced academic performance, lower graduation rates, and less satisfaction with learning. The study intends to develop approaches that encourage a more interesting and learner-motivated educational environment. Methodology: This research uses a mixed methods approach by combining quantitative data from a survey-based questionnaire with qualitative insights from focus groups to explore intrinsic and extrinsic motivators, instructional practices, and student perceptions of relevance and application of course content. The aim of this method is to make an all-inclusive exploration into undergraduate engineering students’ perspectives on factors contributing to this disengagement and the need for more ownership. Contribution: Inculcating passion for engineering among learners seems demanding, with numerous educational programs struggling with issues such as a lack of interest by students and no personal investment in learning. Understanding the causes is of paramount importance. The study gives suggestions to help teachers or institutions create a more engaged and ownership-based learning environment for engineering students. Findings: The findings revealed a tangled web influencing monotonous teaching styles, limited opportunities and applications, and a perceived gap between theoretical knowledge and real-world engineering problems. It emphasized the need to implement more active learning strategies that could increase autonomy and a stronger sense of purpose in their learning journey. It also highlights the potential use of technology in promoting student engagement and ownership. Further research is needed to explore optimal implementation strategies for online simulations, interactive learning platforms, and gamification elements in the engineering curriculum. Recommendations for Practitioners: It highlights the complex interplay of intrinsic and extrinsic motivation factors and the need to re-look at instructional practice and emphasize faculty training to develop a more student-centered approach. It also stresses the need to look into the relevance and application of the course content. Recommendation for Researchers: More work needs to be done with a larger, more diverse sample population across multiple institutions and varied sociocultural and economic backgrounds. Impact on Society: Enhancing learners’ educational experience can result in creating a passionate and competent team of engineers who can face future obstacles fearlessly and reduce the production of half-baked graduates unprepared for the profession’s challenges. Future Research: Conduct long-term studies to assess the impact of active learning and technology use on student outcomes and career readiness. Investigate scaling up successful strategies across diverse engineering programs. See if promising practices work well everywhere.

Simple population-based algorithms for solving optimization problems

Heuristic algorithms are simple yet powerful tools that are capable of yielding acceptable results in a reasonable execution time. Hence, they are being extensively used for solving optimization problems by researchers nowadays. Due to the quantum of computing power and hardware available today, a large number of dimensions and objectives are considered and analyzed effectively. This paper proposes new population-based metaheuristic algorithms that are capable of combining different strategies. The new strategies help in fast converging as well as trying to avoid local optima. The proposed algorithms could be used as single-phase as well as two-phase algorithms with different combinations and tuning parameters. “Best”, “Mean” and “Standard Deviation” are computed for thirty trials in each case. The results are compared with many efficient optimization algorithms available in the literature. Sixty-one popular un-constrained benchmark problems with dimensions varying from two to thousand and fifteen constrained real-world engineering problems are used for the analyses. The results show that the new algorithms perform better for several test cases. The suitability of the new algorithms for solving multi-objective optimization problems is also studied using five numbers of two-objective ZDT problems. Pure Diversity, Spacing, Spread and Hypervolume are the metrics used for the evaluation.

Study on the Dynamic Characteristics of Gears Considering Surface Topography in a Mixed Lubrication State

Based on mixed lubrication analysis, considering the influence of rough interface contact stiffness, contact damping, and interface friction on the gear transmission system, the relationship between interface contact and the overall performance of the gear transmission system has been established. First, the surface topography is characterized using statistical parameters of rough surfaces, and the contact stiffness and damping for tooth surfaces with different roughnesses are calculated. Subsequently, a six degree of freedom gear tribo-dynamics coupling model is developed. Finally, the established tribo-dynamics model is employed to investigate the relationship between surface roughness and the overall performance of the gear transmission system. This study provides a more intimate connection between the contact interface and the general behavior of the gear transmission system, enabling a better representation of real-world engineering problems. The research findings reveal that contact stiffness and damping decrease with increasing surface roughness. Higher roughness leads to greater gear vibration amplitude. Moreover, elevated surface roughness results in intensified meshing force and more significant energy loss. Surprisingly, when the roughness is appropriate, gears with rough surfaces lose less energy than those with smooth surfaces.