改进MFO-LSTM网络的风电机组齿轮箱故障预警研究

风电机组齿轮箱在数据采集与监控系统(SCADA)的帮助下,通过监控齿轮箱油温是否超过阈值实现故障报警,其判断精度不高且问题发现不及时,因此使用长短期记忆网络模型(LSTM)融合SCADA数据实现对齿轮箱油温状态的预测。用齿轮箱正常运行状态下的数据训练LSTM模型,计算油温预测值与真实值之间的残差,根据正态分布的原则设置残差的上下预警阈值,用来对齿轮箱故障进行预警。为简化训练模型的复杂度,在SCADA数据中选用与齿轮箱油温相关性较为密切的参数作为LSTM模型的输入项。为降低因LSTM模型超参数设置不当造成的预测准确度表现不佳,提出改进飞蛾火焰算法(MFO)与LSTM的组合模型,在保留MFO算法强大的全局搜索能力的同时,使其避免陷入局部搜索的陷阱,通过改进MFO对LSTM模型参数进行迭代优化,最终构建合适的模型。最后通过某风电机组SCADA数据验证该方法能够有效预警齿轮箱的故障,并且与其他方法相比准确度更高,预警更及时,迭代效果更好。

基于MFO-BPNN的螺旋钻机钻速预测研究

针对利用现有经验公式所建立的螺旋钻机钻速预测模型存在准确度不足的问题,提出了一种基于飞蛾扑火算法(MFO)的反向传播神经网络(BPNN)钻速预测模型。首先,对MFO算法的基本原理进行了研究,构建了MFO算法优化BPNN的具体流程;接着,采集了江苏无锡某施工现场钻探数据,并分析了钻速影响因素,运用小波阈值降噪、归一化和灰色关联度分析等系列方法对采集数据进行了预处理,得到了训练和测试集;然后,将MFO算法运用于神经网络的权值和阈值训练,以代替原有梯度下降法,建立了MFO-BPNN钻速预测模型;最后,对上述预测模型与BPNN模型、遗传算法优化反向传播神经网络(GA-BPNN)模型以及粒子群优化算法优化反向传播神经网络(PSO-BPNN)模型的预测结果和评价指标进行了详细的对比分析。研究结果表明:运用MFO-BPNN建立的钻速预测模型,其可靠性达到了91.65%,其决定系数(R 2)优于其他3种预测模型,3项误差指标也是其中最低的,说明该模型的预测精度良好,适合于桩基础工程的实际应用,可为复杂因素影响下的钻速预测提供一种新思路。

Specific Order and Bisection Search Aided Joint 3D Beamforming and RIS Reflecting Optimization

In this paper,a three-node transmission model is conceived,where the base station(BS)node leverages 3D beamforming,the reconfigurable intelligent surface(RIS)node can constructively reconfigure the wireless channel,the user node only has a single antenna due to a limited price.Maximization of its downlink spectral efficiency is a joint optimization problem of three variables,namely phase-shift matrixΦof RIS,tilt angleθand beamforming vector w used in BS 3D beamforming.We solve this problem by employing the alternating optimization(AO)algorithm.But,in each iteration,a specific optimization order of firstlyΦ,secondlyθand finally w is proposed,which facilitates the search of optimalθin the way of narrowing its trust region and enabling unimodal property over the narrowed trust region.It finally results in a better combination of{Φ,θ,w}.

Multi-Material Topology Optimization for Spatial-Varying Porous Structures

This paper aims to propose a topology optimization method on generating porous structures comprising multiple materials.The mathematical optimization formulation is established under the constraints of individual volume fraction of constituent phase or total mass,as well as the local volume fraction of all phases.The original optimization problem with numerous constraints is converted into a box-constrained optimization problem by incorporating all constraints to the augmented Lagrangian function,avoiding the parameter dependence in the conventional aggregation process.Furthermore,the local volume percentage can be precisely satisfied.The effects including the globalmass bound,the influence radius and local volume percentage on final designs are exploited through numerical examples.The numerical results also reveal that porous structures keep a balance between the bulk design and periodic design in terms of the resulting compliance.All results,including those for irregular structures andmultiple volume fraction constraints,demonstrate that the proposedmethod can provide an efficient solution for multiple material infill structures.

An Improved JSO and Its Application in Spreader Optimization of Large Span Corridor Bridge

In this paper,given the shortcomings of jellyfish search algorithmwith low search ability in the early stage and easy to fall into local optimal solution,this paper introduces adaptive weight function and elite strategy,improving the global search scope in the early stage and the ability to refine the local development in the later stage.In the numerical study,the benchmark problem of dimensional optimization with a 10-bar truss structure and simultaneous dimensional shape optimization with a 15-bar truss structure is adopted,and the corresponding penalty method is used for constraint treatment.The test results show that the improved jellyfish search algorithm can provide better truss sections as well as weights.Because when the steel main truss of the large-span covered bridge is lifted,the site is limited and the large lifting equipment cannot enter the site,and the original structure does not meet the problem of stress concentration and large deformation of the bolt group,so the spreader is used to lift,and the improved jellyfish search algorithm is introduced into the design optimization of the spreader.The results show that the improved jellyfish algorithm can efficiently and accurately find out the optimal shape and weight of the spreader,and throughMidas Civil simulation,the spreader used canmeet the requirements of weight and safety.

A Subdivision-Based Combined Shape and Topology Optimization in Acoustics

We propose a combined shape and topology optimization approach in this research for 3D acoustics by using the isogeometric boundary element method with subdivision surfaces.The existing structural optimization methods mainly contain shape and topology schemes,with the former changing the surface geometric profile of the structure and the latter changing thematerial distribution topology or hole topology of the structure.In the present acoustic performance optimization,the coordinates of the control points in the subdivision surfaces fine mesh are selected as the shape design parameters of the structure,the artificial density of the sound absorbing material covered on the structure surface is set as the topology design parameter,and the combined topology and shape optimization approach is established through the sound field analysis of the subdivision surfaces boundary element method as a bridge.The topology and shape sensitivities of the approach are calculated using the adjoint variable method,which ensures the efficiency of the optimization.The geometric jaggedness and material distribution discontinuities that appear in the optimization process are overcome to a certain degree by the multiresolution method and solid isotropic material with penalization.Numerical examples are given to validate the effectiveness of the presented optimization approach.

Multi-Stage Multidisciplinary Design Optimization Method for Enhancing Complete Artillery Internal Ballistic Firing Performance

To enhance the comprehensive performance of artillery internal ballistics—encompassing power,accuracy,and service life—this study proposed a multi-stage multidisciplinary design optimization(MS-MDO)method.First,the comprehensive artillery internal ballistic dynamics(AIBD)model,based on propellant combustion,rotation band engraving,projectile axial motion,and rifling wear models,was established and validated.This model was systematically decomposed into subsystems from a system engineering perspective.The study then detailed the MS-MDO methodology,which included Stage I(MDO stage)employing an improved collaborative optimization method for consistent design variables,and Stage II(Performance Optimization)focusing on the independent optimization of local design variables and performance metrics.The methodology was applied to the AIBD problem.Results demonstrated that the MS-MDO method in Stage I effectively reduced iteration and evaluation counts,thereby accelerating system-level convergence.Meanwhile,Stage II optimization markedly enhanced overall performance.These comprehensive evaluation results affirmed the effectiveness of the MS-MDO method.

Enhancing Renewable Energy Integration:A Gaussian-Bare-Bones Levy Cheetah Optimization Approach to Optimal Power Flow in Electrical Networks

In the contemporary era,the global expansion of electrical grids is propelled by various renewable energy sources(RESs).Efficient integration of stochastic RESs and optimal power flow(OPF)management are critical for network optimization.This study introduces an innovative solution,the Gaussian Bare-Bones Levy Cheetah Optimizer(GBBLCO),addressing OPF challenges in power generation systems with stochastic RESs.The primary objective is to minimize the total operating costs of RESs,considering four functions:overall operating costs,voltage deviation management,emissions reduction,voltage stability index(VSI)and power loss mitigation.Additionally,a carbon tax is included in the objective function to reduce carbon emissions.Thorough scrutiny,using modified IEEE 30-bus and IEEE 118-bus systems,validates GBBLCO’s superior performance in achieving optimal solutions.Simulation results demonstrate GBBLCO’s efficacy in six optimization scenarios:total cost with valve point effects,total cost with emission and carbon tax,total cost with prohibited operating zones,active power loss optimization,voltage deviation optimization and enhancing voltage stability index(VSI).GBBLCO outperforms conventional techniques in each scenario,showcasing rapid convergence and superior solution quality.Notably,GBBLCO navigates complexities introduced by valve point effects,adapts to environmental constraints,optimizes costs while considering prohibited operating zones,minimizes active power losses,and optimizes voltage deviation by enhancing the voltage stability index(VSI)effectively.This research significantly contributes to advancing OPF,emphasizing GBBLCO’s improved global search capabilities and ability to address challenges related to local minima.GBBLCO emerges as a versatile and robust optimization tool for diverse challenges in power systems,offering a promising solution for the evolving needs of renewable energy-integrated power grids.

An Optimal Node Localization in WSN Based on Siege Whale Optimization Algorithm

Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand allocates the acquired location information to unknown devices. The metaheuristic approach is one of themost advantageous ways to deal with this challenging issue and overcome the disadvantages of the traditionalmethods that often suffer from computational time problems and small network deployment scale. This studyproposes an enhanced whale optimization algorithm that is an advanced metaheuristic algorithm based on thesiege mechanism (SWOA) for node localization inWSN. The objective function is modeled while communicatingon localized nodes, considering variables like delay, path loss, energy, and received signal strength. The localizationapproach also assigns the discovered location data to unidentified devices with the modeled objective functionby applying the SWOA algorithm. The experimental analysis is carried out to demonstrate the efficiency of thedesigned localization scheme in terms of various metrics, e.g., localization errors rate, converges rate, and executedtime. Compared experimental-result shows that theSWOA offers the applicability of the developed model forWSNto perform the localization scheme with excellent quality. Significantly, the error and convergence values achievedby the SWOA are less location error, faster in convergence and executed time than the others compared to at least areduced 1.5% to 4.7% error rate, and quicker by at least 4%and 2% in convergence and executed time, respectivelyfor the experimental scenarios.

Hybrid Architecture and Beamforming Optimization for Millimeter Wave Systems

Hybrid beamforming(HBF)has become an attractive and important technology in massive multiple-input multiple-output(MIMO)millimeter-wave(mmWave)systems.There are different hybrid architectures in HBF depending on different connection strategies of the phase shifter network between antennas and radio frequency chains.This paper investigates HBF optimization with different hybrid architectures in broadband point-to-point mmWave MIMO systems.The joint hybrid architecture and beamforming optimization problem is divided into two sub-problems.First,we transform the spectral efficiency maximization problem into an equivalent weighted mean squared error minimization problem,and propose an algorithm based on the manifold optimization method for the hybrid beamformer with a fixed hybrid architecture.The overlapped subarray architecture which balances well between hardware costs and system performance is investigated.We further propose an algorithm to dynamically partition antenna subarrays and combine it with the HBF optimization algorithm.Simulation results are presented to demonstrate the performance improvement of our proposed algorithms.

Multi-Strategy Assisted Multi-Objective Whale Optimization Algorithm for Feature Selection

In classification problems,datasets often contain a large amount of features,but not all of them are relevant for accurate classification.In fact,irrelevant features may even hinder classification accuracy.Feature selection aims to alleviate this issue by minimizing the number of features in the subset while simultaneously minimizing the classification error rate.Single-objective optimization approaches employ an evaluation function designed as an aggregate function with a parameter,but the results obtained depend on the value of the parameter.To eliminate this parameter’s influence,the problem can be reformulated as a multi-objective optimization problem.The Whale Optimization Algorithm(WOA)is widely used in optimization problems because of its simplicity and easy implementation.In this paper,we propose a multi-strategy assisted multi-objective WOA(MSMOWOA)to address feature selection.To enhance the algorithm’s search ability,we integrate multiple strategies such as Levy flight,Grey Wolf Optimizer,and adaptive mutation into it.Additionally,we utilize an external repository to store non-dominant solution sets and grid technology is used to maintain diversity.Results on fourteen University of California Irvine(UCI)datasets demonstrate that our proposed method effectively removes redundant features and improves classification performance.The source code can be accessed from the website:https://github.com/zc0315/MSMOWOA.

Development of Fixture Layout Optimization for Thin-Walled Parts:A Review

An increasing number of researchers have researched fixture layout optimization for thin-walled part assembly during the past decades.However,few papers systematically review these researches.By analyzing existing literature,this paper summarizes the process of fixture layout optimization and the methods applied.The process of optimization is made up of optimization objective setting,assembly variation/deformation modeling,and fixture layout optimization.This paper makes a review of the fixture layout for thin-walled parts according to these three steps.First,two different kinds of optimization objectives are introduced.Researchers usually consider in-plane variations or out-of-plane deformations when designing objectives.Then,modeling methods for assembly variation and deformation are divided into two categories:Mechanism-based and data-based methods.Several common methods are discussed respectively.After that,optimization algorithms are reviewed systematically.There are two kinds of optimization algorithms:Traditional nonlinear programming and heuristic algorithms.Finally,discussions on the current situation are provided.The research direction of fixture layout optimization in the future is discussed from three aspects:Objective setting,improving modeling accuracy and optimization algorithms.Also,a new research point for fixture layout optimization is discussed.This paper systematically reviews the research on fixture layout optimization for thin-walled parts,and provides a reference for future research in this field.

Synergistic Swarm Optimization Algorithm

This research paper presents a novel optimization method called the Synergistic Swarm Optimization Algorithm(SSOA).The SSOA combines the principles of swarmintelligence and synergistic cooperation to search for optimal solutions efficiently.A synergistic cooperation mechanism is employed,where particles exchange information and learn from each other to improve their search behaviors.This cooperation enhances the exploitation of promising regions in the search space while maintaining exploration capabilities.Furthermore,adaptive mechanisms,such as dynamic parameter adjustment and diversification strategies,are incorporated to balance exploration and exploitation.By leveraging the collaborative nature of swarm intelligence and integrating synergistic cooperation,the SSOAmethod aims to achieve superior convergence speed and solution quality performance compared to other optimization algorithms.The effectiveness of the proposed SSOA is investigated in solving the 23 benchmark functions and various engineering design problems.The experimental results highlight the effectiveness and potential of the SSOA method in addressing challenging optimization problems,making it a promising tool for a wide range of applications in engineering and beyond.Matlab codes of SSOA are available at:https://www.mathworks.com/matlabcentral/fileexchange/153466-synergistic-swarm-optimization-algorithm.

Evolutionary Optimization Methods for High-Dimensional Expensive Problems:A Survey

Evolutionary computation is a rapidly evolving field and the related algorithms have been successfully used to solve various real-world optimization problems.The past decade has also witnessed their fast progress to solve a class of challenging optimization problems called high-dimensional expensive problems(HEPs).The evaluation of their objective fitness requires expensive resource due to their use of time-consuming physical experiments or computer simulations.Moreover,it is hard to traverse the huge search space within reasonable resource as problem dimension increases.Traditional evolutionary algorithms(EAs)tend to fail to solve HEPs competently because they need to conduct many such expensive evaluations before achieving satisfactory results.To reduce such evaluations,many novel surrogate-assisted algorithms emerge to cope with HEPs in recent years.Yet there lacks a thorough review of the state of the art in this specific and important area.This paper provides a comprehensive survey of these evolutionary algorithms for HEPs.We start with a brief introduction to the research status and the basic concepts of HEPs.Then,we present surrogate-assisted evolutionary algorithms for HEPs from four main aspects.We also give comparative results of some representative algorithms and application examples.Finally,we indicate open challenges and several promising directions to advance the progress in evolutionary optimization algorithms for HEPs.

MCWOA Scheduler:Modified Chimp-Whale Optimization Algorithm for Task Scheduling in Cloud Computing

Cloud computing provides a diverse and adaptable resource pool over the internet,allowing users to tap into various resources as needed.It has been seen as a robust solution to relevant challenges.A significant delay can hamper the performance of IoT-enabled cloud platforms.However,efficient task scheduling can lower the cloud infrastructure’s energy consumption,thus maximizing the service provider’s revenue by decreasing user job processing times.The proposed Modified Chimp-Whale Optimization Algorithm called Modified Chimp-Whale Optimization Algorithm(MCWOA),combines elements of the Chimp Optimization Algorithm(COA)and the Whale Optimization Algorithm(WOA).To enhance MCWOA’s identification precision,the Sobol sequence is used in the population initialization phase,ensuring an even distribution of the population across the solution space.Moreover,the traditional MCWOA’s local search capabilities are augmented by incorporating the whale optimization algorithm’s bubble-net hunting and random search mechanisms into MCWOA’s position-updating process.This study demonstrates the effectiveness of the proposed approach using a two-story rigid frame and a simply supported beam model.Simulated outcomes reveal that the new method outperforms the original MCWOA,especially in multi-damage detection scenarios.MCWOA excels in avoiding false positives and enhancing computational speed,making it an optimal choice for structural damage detection.The efficiency of the proposed MCWOA is assessed against metrics such as energy usage,computational expense,task duration,and delay.The simulated data indicates that the new MCWOA outpaces other methods across all metrics.The study also references the Whale Optimization Algorithm(WOA),Chimp Algorithm(CA),Ant Lion Optimizer(ALO),Genetic Algorithm(GA)and Grey Wolf Optimizer(GWO).

An Overview of Sequential Approximation in Topology Optimization of Continuum Structure

This paper offers an extensive overview of the utilization of sequential approximate optimization approaches in the context of numerically simulated large-scale continuum structures.These structures,commonly encountered in engineering applications,often involve complex objective and constraint functions that cannot be readily expressed as explicit functions of the design variables.As a result,sequential approximation techniques have emerged as the preferred strategy for addressing a wide array of topology optimization challenges.Over the past several decades,topology optimization methods have been advanced remarkably and successfully applied to solve engineering problems incorporating diverse physical backgrounds.In comparison to the large-scale equation solution,sensitivity analysis,graphics post-processing,etc.,the progress of the sequential approximation functions and their corresponding optimizersmake sluggish progress.Researchers,particularly novices,pay special attention to their difficulties with a particular problem.Thus,this paper provides an overview of sequential approximation functions,related literature on topology optimization methods,and their applications.Starting from optimality criteria and sequential linear programming,the other sequential approximate optimizations are introduced by employing Taylor expansion and intervening variables.In addition,recent advancements have led to the emergence of approaches such as Augmented Lagrange,sequential approximate integer,and non-gradient approximation are also introduced.By highlighting real-world applications and case studies,the paper not only demonstrates the practical relevance of these methods but also underscores the need for continued exploration in this area.Furthermore,to provide a comprehensive overview,this paper offers several novel developments that aim to illuminate potential directions for future research.

A Comparative Study of Metaheuristic Optimization Algorithms for Solving Real-World Engineering Design Problems

Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve.Such design problems are widely experienced in many engineering fields,such as industry,automotive,construction,machinery,and interdisciplinary research.However,there are established optimization techniques that have shown effectiveness in addressing these types of issues.This research paper gives a comparative study of the implementation of seventeen new metaheuristic methods in order to optimize twelve distinct engineering design issues.The algorithms used in the study are listed as:transient search optimization(TSO),equilibrium optimizer(EO),grey wolf optimizer(GWO),moth-flame optimization(MFO),whale optimization algorithm(WOA),slimemould algorithm(SMA),harris hawks optimization(HHO),chimp optimization algorithm(COA),coot optimization algorithm(COOT),multi-verse optimization(MVO),arithmetic optimization algorithm(AOA),aquila optimizer(AO),sine cosine algorithm(SCA),smell agent optimization(SAO),and seagull optimization algorithm(SOA),pelican optimization algorithm(POA),and coati optimization algorithm(CA).As far as we know,there is no comparative analysis of recent and popular methods against the concrete conditions of real-world engineering problems.Hence,a remarkable research guideline is presented in the study for researchersworking in the fields of engineering and artificial intelligence,especiallywhen applying the optimization methods that have emerged recently.Future research can rely on this work for a literature search on comparisons of metaheuristic optimization methods in real-world problems under similar conditions.

Identifying influential spreaders in social networks: A two-stage quantum-behaved particle swarm optimization with Lévy flight

The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy can obtain good accuracy, they come at the cost of enormous computational time, and are therefore not applicable to practical scenarios in large-scale networks. In addition, the centrality heuristic algorithms that are based on network topology can be completed in relatively less time. However, they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread. In this work, we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders. According to the framework,first, the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations. Second, the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network. Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known algorithms.

A modified back analysis method for deep excavation with multi-objective optimization procedure

Real-time prediction of excavation-induced displacement of retaining pile during the deep excavation process is crucial for construction safety.This paper proposes a modified back analysis method with multi-objective optimization procedure,which enables a real-time prediction of horizontal displacement of retaining pile during construction.As opposed to the traditional stage-by-stage back analysis,time series monitoring data till the current excavation stage are utilized to form a multi-objective function.Then,the multi-objective particle swarm optimization (MOPSO) algorithm is applied for parameter identification.The optimized model parameters are immediately adopted to predict the excavation-induced pile deformation in the continuous construction stages.To achieve efficient parameter optimization and real-time prediction of system behavior,the back propagation neural network (BPNN) is established to substitute the finite element model,which is further implemented together with MOPSO for automatic operation.The proposed approach is applied in the Taihu tunnel excavation project,where the effectiveness of the method is demonstrated via the comparisons with the site monitoring data.The method is reliable with a prediction accuracy of more than 90%.Moreover,different optimization algorithms,including non-dominated sorting genetic algorithm (NSGA-II),Pareto Envelope-based Selection Algorithm II (PESA-II) and MOPSO,are compared,and their influences on the prediction accuracy at different excavation stages are studied.The results show that MOPSO has the best performance for high dimensional optimization task.

Fixed-Time Cluster Optimization for Multi-Agent Systems Based on Piecewise Power-Law Design

Dear Editor,This letter focuses on the fixed-time(FXT)cluster optimization problem of first-order multi-agent systems(FOMASs)in an undirected network,in which the optimization objective is the sum of the objective functions of all clusters.A novel piecewise power-law control protocol with cooperative-competition relations is proposed.Furthermore,a sufficient condition is obtained to ensure that the FOMASs achieve the cluster consensus within an FXT.