期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到51,988篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A Review of Genetic Algorithms:Principles, Procedures, and Applications in Optimization 认领 引用
1
作者 M.A.El-Shorbagy 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第4期138-184,共47页
This paper provides a thorough examination of Genetic Algorithms(GAs),a category of evolutionary computation methods derived from the concepts of natural selection and genetics.The main concept and operational princip... This paper provides a thorough examination of Genetic Algorithms(GAs),a category of evolutionary computation methods derived from the concepts of natural selection and genetics.The main concept and operational principle of GAs are elucidated,highlighting the evolution of populations of candidate solutions across multiple generations to get optimal or near-optimal solutions for complicated problems.The paper delineates the sequential phases of a conventional GA,encompassing problem formulation,solution encoding,initialization of population,fitness evaluation,selection,crossover,mutation,and termination criteria,so offering a coherent framework for comprehending the algorithm’s functionality.Moreover,numerous prominent genetic operators,including crossover and mutation,are examined,highlighting their distinct forms and processes for fostering diversity and exploration within the search space.Also,the paper emphasizes the benefits of GAs,including their capacity to address nonlinear,multimodal,and high-dimensional optimization challenges without necessitating gradient information,along with their adaptability in resolving both continuous and discrete issues.The limitations and constraints of GAs,such as computing expense,parameter optimization,and the risk of premature convergence,are thoroughly analyzed.The paper examines various applications of GAs across fields,including engineering design,control systems,combinatorial optimization,machine learning,operations research,and multi-objective optimization,demonstrating the versatility and practical significance of this evolutionary method.This work establishes a robust basis for scholars and practitioners seeking to implement GAs in intricate optimization challenges.The review indicates that GAs have greatly progressed from Holland’s original formulation to specialized variations,such as real-valued,permutation,and tree-based encodings,each tailored to certain issue categories.The critical study indicates that although classical GAs are proficient in global exploration,their hybridization with local search techniques(memetic algorithms),swarm intelligence(GA-PSO),and surrogate models significantly improves convergence time and solution accuracy.The study highlights ongoing research deficiencies,such as the disparity between theoretical convergence proofs and the actual performance of algorithms,as well as the necessity for systematic recommendations in the design of hybrid algorithms. 展开更多
关键词 Genetic algorithm evolutionary computation global optimization nonlinear optimization computational intelligence optimization techniques
暂未订购 下载PDF
Optimization of Truss Structures Using Nature-Inspired Algorithms with Frequency and Stress Constraints 认领 引用 被引量：1
2
作者 Sanjog Chhetri Sapkota Liborio Cavaleri +3 位作者 Ajaya Khatri Siddhi Pandey Satish Paudel Panagiotis G.Asteris 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第1期436-464,共29页
Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises stru... Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises structural weight under stress and frequency constraints.Two new algorithms,the Red Kite Optimization Algorithm(ROA)and Secretary Bird Optimization Algorithm(SBOA),are utilized on five benchmark trusses with 10,18,37,72,and 200-bar trusses.Both algorithms are evaluated against benchmarks in the literature.The results indicate that SBOA always reaches a lighter optimal.Designs with reducing structural weight ranging from 0.02%to 0.15%compared to ROA,and up to 6%–8%as compared to conventional algorithms.In addition,SBOA can achieve 15%–20%faster convergence speed and 10%–18%reduction in computational time with a smaller standard deviation over independent runs,which demonstrates its robustness and reliability.It is indicated that the adaptive exploration mechanism of SBOA,especially its Levy flight–based search strategy,can obviously improve optimization performance for low-and high-dimensional trusses.The research has implications in the context of promoting bio-inspired optimization techniques by demonstrating the viability of SBOA,a reliable model for large-scale structural design that provides significant enhancements in performance and convergence behavior. 展开更多
关键词 Optimization truss structures nature-inspired algorithms meta-heuristic algorithms red kite opti-mization algorithm secretary bird optimization algorithm
暂未订购 下载PDF
An Overall Optimization Model Using Metaheuristic Algorithms for the CNN-Based IoT Attack Detection Problem 认领 引用 被引量：1
3
作者 Le Thi Hong Van Le Duc Thuan +1 位作者 Pham Van Huong Nguyen Hieu Minh 《Computers, Materials & Continua》 SCIE EI 2026年第4期1934-1964,共31页
Optimizing convolutional neural networks(CNNs)for IoT attack detection remains a critical yet challenging task due to the need to balance multiple performance metrics beyond mere accuracy.This study proposes a unified... Optimizing convolutional neural networks(CNNs)for IoT attack detection remains a critical yet challenging task due to the need to balance multiple performance metrics beyond mere accuracy.This study proposes a unified and flexible optimization framework that leverages metaheuristic algorithms to automatically optimize CNN configurations for IoT attack detection.Unlike conventional single-objective approaches,the proposed method formulates a global multi-objective fitness function that integrates accuracy,precision,recall,and model size(speed/model complexity penalty)with adjustable weights.This design enables both single-objective and weightedsum multi-objective optimization,allowing adaptive selection of optimal CNN configurations for diverse deployment requirements.Two representativemetaheuristic algorithms,GeneticAlgorithm(GA)and Particle Swarm Optimization(PSO),are employed to optimize CNNhyperparameters and structure.At each generation/iteration,the best configuration is selected as themost balanced solution across optimization objectives,i.e.,the one achieving themaximum value of the global objective function.Experimental validation on two benchmark datasets,Edge-IIoT and CIC-IoT2023,demonstrates that the proposed GA-and PSO-based models significantly enhance detection accuracy(94.8%–98.3%)and generalization compared with manually tuned CNN configurations,while maintaining compact architectures.The results confirm that the multi-objective framework effectively balances predictive performance and computational efficiency.This work establishes a generalizable and adaptive optimization strategy for deep learning-based IoT attack detection and provides a foundation for future hybrid metaheuristic extensions in broader IoT security applications. 展开更多
关键词 Genetic algorithm(GA) particle swarm optimization(PSO) multi-objective optimization convolutional neural network—CNN IoT attack detection metaheuristic optimization CNN configuration
暂未订购 下载PDF
Design and Optimization of Visual Algorithms for Inspection Robots 认领 引用
4
作者 Yong Zhang Zuling Tu +2 位作者 Yanan Qian Ruiyang Zhang Jin Li 《Journal of Electronic Research and Application》 2026年第4期228-234,共7页
As an important equipment for intelligent operation and maintenance,inspection robots have been widely used in high-risk and complex scenarios such as power,mining,and chemical industries.The visual system,as the“eye... As an important equipment for intelligent operation and maintenance,inspection robots have been widely used in high-risk and complex scenarios such as power,mining,and chemical industries.The visual system,as the“eyes”of inspection robots,undertakes tasks including image enhancement,navigation and positioning,target recognition,and error correction,and its performance directly affects the robots’autonomous operation capabilities.Currently,the visual algorithms of inspection robots still face several problems,such as poor adaptability to complex environments,insufficient navigation accuracy,difficulty in balancing target recognition accuracy and real-time performance,and weak adaptability of error correction.Combined with the current application status of inspection robots,this paper elaborates on the design ideas of the four major modules of visual algorithms and proposes optimization strategies for existing problems,providing references for improving the autonomous inspection capabilities of inspection robots and promoting the upgrading of intelligent inspection technology. 展开更多
关键词 Inspection robot Visual algorithm Design Optimization
暂未订购 下载PDF
Optimization Algorithms Based on Double-Integral Coevolutionary Neurodynamics in Deep Learning 认领 引用
5
作者 Dan Su Jie Han +1 位作者 Chunhua Yang Weihua Gui 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2025年第6期1236-1245,共10页
Deep neural networks are increasingly exposed to attack threats,and at the same time,the need for privacy protection is growing.As a result,the challenge of developing neural networks that are both robust and capable ... Deep neural networks are increasingly exposed to attack threats,and at the same time,the need for privacy protection is growing.As a result,the challenge of developing neural networks that are both robust and capable of strong generalization while maintaining privacy becomes pressing.Training neural networks under privacy constraints is one way to minimize privacy leakage,and one way to do this is to add noise to the data or model.However,noise may cause gradient directions to deviate from the optimal trajectory during training,leading to unstable parameter updates,slow convergence,and reduced model generalization capability.To overcome these challenges,we propose an optimization algorithm based on double-integral coevolutionary neurodynamics(DICND),designed to accelerate convergence and improve generalization in noisy conditions.Theoretical analysis proves the global convergence of the DICND algorithm and demonstrates its ability to converge to near-global minima efficiently under noisy conditions.Numerical simulations and image classification experiments further confirm the DICND algorithm's significant advantages in enhancing generalization performance. 展开更多
关键词 Coevolutionary neurodynamics(CND) deep learning generalization noise resistance optimization algorithm
暂未订购 下载PDF
Optimization of the frequency offset increment of FDA-MIMO based on cuckoo search algorithm 认领 引用 被引量：1
6
作者 WANG Bo ZHAO Yu +2 位作者 LI Yonglin YANG Rennong XUE Junjie 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2026年第1期157-170,共14页
Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic e... Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic environments.The effectiveness of interference suppression by FDA-MIMO is limited by the inherent range-angle coupling issue in the FDA beampattern.Existing literature primarily focuses on control methods for FDA-MIMO radar beam direction under the assumption of static beampatterns,with insufficient exploration of techniques for managing nonstationary beam directions.To address this gap,this paper initially introduces the FDA-MIMO signal model and the calculation formula for the FDA-MIMO array output using the minimum variance distortionless response(MVDR)beamformer.Building on this,the problem of determining the optimal frequency offset for the FDA is rephrased as a convex optimization problem,which is then resolved using the cuckoo search(CS)algorithm.Simulations confirm the effectiveness of the proposed approach,showing that the frequency offsets obtained through the CS algorithm can create a dot-shaped beam direction at the target location while effectively suppressing interference signals within the mainlobe. 展开更多
关键词 frequency diverse array multiple-input multiple-output(FDA-MIMO) convex optimization cuckoo search algorithm beampattern
暂未订购 下载PDF
An Efficient Evolutionary Algorithm for Few-for-Many Optimization 认领 引用
7
作者 Ke Shang Hisao Ishibuchi +1 位作者 Zexuan Zhu Qingfu Zhang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2026年第6期1362-1377,共16页
Few-for-many(F4M)optimization,recently introduced as a novel paradigm in multi-objective optimization,aims to find a small set of solutions that effectively handle a large number of conflicting objectives.Unlike tradi... Few-for-many(F4M)optimization,recently introduced as a novel paradigm in multi-objective optimization,aims to find a small set of solutions that effectively handle a large number of conflicting objectives.Unlike traditional many-objective optimization methods,which typically attempt comprehensive coverage of the Pareto front,F4M optimization emphasizes finding a small representative solution set to efficiently address highdimensional objective spaces.Motivated by the computational complexity and practical relevance of F4M optimization,this paper proposes a new evolutionary algorithm explicitly tailored for efficiently solving F4M optimization problems.Inspired by Smetric selection evolutionary multi-objective optimization algorithm(SMS-EMOA),our proposed approach employs a(μ+1)-evolution strategy guided by the objective of F4M optimization.Furthermore,to facilitate rigorous performance assessment,we propose a novel benchmark test suite specifically designed for F4M optimization by leveraging the similarity betw een the R2indicator and F4M formulations.Our test suite is highly flexible,allowing any existing multi-objective optimization problem to be transformed into a corresponding F4M instance via scalarization using the weighted Tchebycheff function.Comprehensive experimental evaluations on benchmarks demonstrate the superior performance of our algorithm compared to existing state-of-the-art algorithms,especially on instances involving a large number of objectives.The source code of the proposed algorithm will be released publicly.Source code is available at http://gffzz188fe103f8f1460as666bu6cf5vqw6q9n.ffgz.tsg.suse.edu.cn/MOL-SZU/SoM-EMOA. 展开更多
关键词 Evolutionary algorithm few-for-many optimization many-objective optimization (MOO) multi-objective optimization
暂未订购 下载PDF
Theory Evolution Optimization:A Metaheuristic Algorithm BaSed on Evolution Process of Theory 认领 引用
8
作者 Jiacong Liu Jiaze Tu +5 位作者 Chunguang Bi Huiling Chen Ali Asghar Heidari Hao Xie Lei Liu Yi Chen 《Journal of Bionic Engineering》 SCIE EI CSCD 2026年第2期1015-1060,共46页
Metaheuristic algorithms have emerged as indispensable tools for solving NP-hard optimization problems that defy traditional methods.To advance the field’s focus on algorithmic performance,this study introduces the T... Metaheuristic algorithms have emerged as indispensable tools for solving NP-hard optimization problems that defy traditional methods.To advance the field’s focus on algorithmic performance,this study introduces the Theory Evolution Optimization(TEO)–an efficient metaheuristic inspired by the evolution of scientific theory.TEO simulates the competitive,accumulative,and replacement processes among scientific hypotheses,mirroring the evolution from a hypothesis to an established scientific theory.The performance of TEO is validated through extensive experimental simulations and benchmarked against 28 popular algorithms,including highly competitive champions such as EBOwithCMAR,LSHADE_cnEpSi,and LSHADE.Pairwise comparisons between TEO and the latest algorithms are conducted using the Wilcoxon signed-rank test,with multiple comparisons managed by the Friedman test.Initially,TEO is tested on the classical IEEE CEC2017 and the latest IEEE CEC2022 benchmark functions.TEO successfully addresses four prominent engineering design problems in constrained continuous space for practical applications.Additionally,a binary TEO(BTEO)variant is introduced and applied to feature selection tasks in discrete space.Experimental results consistently demonstrate that TEO proposes highly competitive outcomes in optimization problems.The source codes for this research are accessible to the public at http://gffzze767f4cc5ce545d8s666bu6cf5vqw6q9n.ffgz.tsg.suse.edu.cn/TEO.html. 展开更多
关键词 Optimization,metaheuristic algorithms Evolution of scientific theory Theory evolution optimizers Engineering design optimization Feature selection
Optimization of a self-tuning force control system for the milling process using a dynamic enhanced genetic algorithm 认领 引用
9
作者 Yao Li Zhengcai Zhao +3 位作者 Ning Qian Lei Zhang Wenfeng Ding Yucan Fu 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2026年第2期33-43,共11页
When milling structural components with varying axial depths and widths,cutting forces tend to fluctuate,negatively impacting tool life and machining accuracy.To mitigate the force fluctuations and enhance tool longev... When milling structural components with varying axial depths and widths,cutting forces tend to fluctuate,negatively impacting tool life and machining accuracy.To mitigate the force fluctuations and enhance tool longevity,developing a simple,reliable,and easy-to-implement force control system for milling is essential,which is an important step toward advancing intelligent manufacturing.This paper explores the use of genetic algorithms(GA) for powerful optimization capabilities in developing self-tuning milling force controllers.A comprehensive framework for optimizing a fuzzy logic controller using an enhanced GA is specifically designed for the milling process.The optimization integrates the GA with a simulation model,fine-tuning membership functions and optimizing fuzzy rule selection.The enhanced GA incorporates the Integral of Time-weighted Absolute Error(ITAE) as the fitness criterion to improve the robustness and responsiveness of the controller.The optimized fuzzy logic controller is implemented within a computer numerical control system,adjusting feed rates in real-time to control milling forces.The performance of the proposed controller is validated through step and slope milling tests,demonstrating an average control accuracy of 95.52%.Comparative evaluations with other controllers show that the proposed system offers a significant improvement,achieving up to 4.58% better control accuracy in step milling tests. 展开更多
关键词 Optimization Self-tuning Force control system Milling process Genetic algorithm
暂未订购 下载PDF
A Metaheuristic Football Optimization Algorithm Integrated with Large Language Models for Automated Seismic Time-Series Modeling 认领 引用
10
作者 Amal H.Alharbi Marwa M.Eid +2 位作者 Nima Khodadadi Ebrahim A.Mattar Sayed Elkenawy 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第5期947-987,共41页
Seismic time series forecasting remains challenging due to the nonlinearity,non-stationarity,and noise of earthquake data,and because deep learning models are sensitive to preprocessing and hyperparameter settings.Alt... Seismic time series forecasting remains challenging due to the nonlinearity,non-stationarity,and noise of earthquake data,and because deep learning models are sensitive to preprocessing and hyperparameter settings.Although recent studies have improved neural architectures and optimization techniques,preprocessing is often treated as a fixed or manually designed stage,with limited integration into model optimization.To address this,this paper proposes an integrated,data-driven modelling framework that combines guided preprocessing with systematic hyperparameter optimization for seismic prediction,specifically forecasting earthquake magnitude from seismic catalog time-series data,with experiments conducted on Canadian seismic records.The method uses a Large Language Model to guide data preparation and feature engineering,rather than fully automate them,and applies deep learning-based forecasting with the N-HITS architecture,optimized via metaheuristic-assisted feature selection and hyperparameter tuning.The Football Optimization Algorithm(FbOA),employed as a metaheuristic optimization strategy in this study,is evaluated and compared with several well-known optimizers under identical conditions.The results show significant performance gains,with FbOA achieving superior accuracy,robustness,and convergence compared to baseline and competing methods.Notably,error metrics are reduced(MSE 3.10×10-7,RMSE 5.57×103),with high performance indicators(r=0.982,R2=0.979,NSE=0.981,WI=0.985).These results highlight the value of integrating guided preprocessing with optimization and demonstrate a scalable framework for high-precision time-series prediction in geophysical and related domains. 展开更多
关键词 Seismic time-series forecasting large language models metaheuristic algorithms football optimization algorithm earthquake modeling
暂未订购 下载PDF
Phased-Enhancement Marine Predators Algorithm for Global Optimization and Medical Insurance Fraud Detection 认领 引用
11
作者 Wen Long Yujia Wang +2 位作者 Qinghua Long Yang Yang Ming Xu 《Journal of Bionic Engineering》 SCIE EI CSCD 2026年第2期1088-1111,共24页
The Marine Predators Algorithm(MPA),while promising for complex optimization,suffers from limited solution precision,imbalanced exploration–exploitation,and premature convergence.To address these shortcomings,this pa... The Marine Predators Algorithm(MPA),while promising for complex optimization,suffers from limited solution precision,imbalanced exploration–exploitation,and premature convergence.To address these shortcomings,this paper proposes a phased-enhancement variant named PEMPA,which integrates three novel strategies into distinct phases of MPA:1)embedding historical best positions in the high-velocity ratio phase to refine solution quality;2)introducing an adaptive inertia weight based on an inverted Sigmoid function in the unit-velocity ratio phase to systematically balance exploration and exploitation;and 3)designing a two-stage opposition-based learning operator in the low-velocity ratio phase to prevent premature convergence.The performance of PEMPA is comprehensively evaluated across 23 classical benchmark functions,the IEEE Congress on Evolutionary Computation(CEC)2017 test suite,21 feature selection tasks,and a real-world medical insurance fraud detection problem.Experimental results confirm that the proposed strategies significantly enhance the efficiency and robustness of MPA.Furthermore,PEMPA demonstrates highly competitive performance compared with several state-of-the-art metaheuristic algorithms,validating its effectiveness and scalability for diverse optimization challenges. 展开更多
关键词 Marine predators algorithm Opposite-based learning Inertia weight Numerical optimization Feature selection
Parametric control of UAV U-turns in turbulent wind conditions based on global optimization 认领 引用
12
作者 Liguo TAN Yongcheng XIONG +3 位作者 Changqing HU Jianfeng LI Oleg KUZENKOV Samvel NALCHAJYAN 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2026年第1期398-409,共12页
Unmanned aircraft are highly vulnerable to crosswind-induced turbulence during complex maneuvers such as turning,which can significantly compromise control and reduce autopilot effectiveness.This paper presents a nove... Unmanned aircraft are highly vulnerable to crosswind-induced turbulence during complex maneuvers such as turning,which can significantly compromise control and reduce autopilot effectiveness.This paper presents a novel control strategy to improve the controllability of unmanned aircraft in challenging wind conditions.First,the equations of motion for the aircraft are reformulated as a system of stochastic differential equations,which are subsequently transformed into a deterministic form.By modeling turbulence as a Gaussian random process and incorporating it directly into the control system,the proposed method proactively compensates for the adverse effects of turbulence.The transformation is achieved using semi-invariant techniques.Second,the control problem is formulated as an optimization task,aiming to minimize the deviation between the actual and desired turn characteristics,specifically the angular velocity.Finally,a new numerical method with proven global convergence is employed to compute the optimal autopilot parameters.Simulation results using a medium-range unmanned aircraft model under continuous turbulent gusts demonstrate that the proposed method significantly outperforms existing approaches,ensuring both stability and precision in turbulent wind conditions. 展开更多
关键词 Parametric control Rigid-wing unmanned aerial vehicle Stochastic system Global optimization Evolutionary algorithm
暂未订购 下载PDF
Novel Sea Otter Optimization Algorithm for WSN Coverage Intelligence Optimization 认领 引用
13
作者 WU Jin GAO Yaqiong +2 位作者 SU Zhengdong CHONG Gege XIONG Hao 《Journal of Shanghai Jiaotong university(Science)》 EI 2026年第4期828-842,I0002,共15页
A novel intelligent optimization algorithm inspired by nature,called sea otter optimization algorithm(SOOA),is proposed.The SOOA simulates the natural behaviors of sea otters,such as using tactile senses to search for... A novel intelligent optimization algorithm inspired by nature,called sea otter optimization algorithm(SOOA),is proposed.The SOOA simulates the natural behaviors of sea otters,such as using tactile senses to search for food in seawater,grooming their fur,feeding with the aid of stones,and escaping from danger.In the exploration stage,a wetness factor is introduced to control the behavior of sea otters in foraging and grooming;a danger factor is introduced to control the behavior of sea otters in feeding and avoiding dangers in the exploitation stage,and the behaviors of sea otters in responding to different dangers are mathematically modeled.The proposed algorithm is compared with 9 well-known intelligent optimization algorithms,and evaluated in 13 benchmark functions as well as wireless sensor network coverage optimization problems to verify the effectiveness of the proposed algorithm.The experimental results show that the node coverage after SOOA optimization reaches 91.2%in 2D environment and 90.47%in 3D environment.Compared with other algorithms,SOOA is superior and possesses the ability to solve complex optimization problems. 展开更多
关键词 sea otter optimization algorithm(SOOA) swarm intelligence optimization wireless sensor network coverage optimization
暂未订购 下载PDF
Quantum computing-enhanced topology optimization with stress constraints for truss structures 认领 引用
14
作者 Yan Wang Dixiong Yang +1 位作者 Zhenzeng Lei Guohai Chen 《Acta Mechanica Sinica》 SCIE EI CAS CSCD 2026年第6期41-57,共17页
Quantum computing,leveraging the properties of quantum physics such as quantum superposition and entanglement,possesses the potential for exponential acceleration compared to classical computing.It can significantly e... Quantum computing,leveraging the properties of quantum physics such as quantum superposition and entanglement,possesses the potential for exponential acceleration compared to classical computing.It can significantly enhance solution efficiency in topology optimization and effectively avoid the entrapment in local optima.This paper proposes a hybrid classical-quantum computing framework to solve the stress-constrained topology optimization problem for truss structures.Initially,structural analyses are performed on a classical computer to determine the stresses of truss members.Then,the optimization problem is formulated through incremental updates of member cross-sectional areas to make it compatible with a quantum annealer.The update strategy consists of a directional-control function and a magnitude-control function.By embedding stress constraints directly into the directional-control function,the original optimization problem is reformulated as a quadratic unconstrained binary optimization model suitable for quantum annealing.To realize a balance between solution accuracy and iteration efficiency,a dynamic strategy for adjusting the magnitude of area increments is proposed.Thus,the quantum annealer can effectively achieve the optimal solutions.When only the access time of the quantum processing unit is considered,the results from 2D and 3D examples of truss topology optimization validate the effectiveness of the proposed framework,and demonstrate the great potential of quantum computing in structural optimization. 展开更多
关键词 Topology optimization Truss structures Quantum computing Quantum annealing algorithm Quadratic unconstrained binary optimization problem
暂未订购 下载PDF
Experience-guided optimization of jacket foundations for offshore wind turbines in varying water depths based on finite element analysis and the genetic algorithm 认领 引用
15
作者 Jiajia HUANG Tao JIN +6 位作者 Jianwu HUANG Shasha SONG Wei DAI Chaoqun ZUO Lizhong WANG Lilin WANG Zhen GUO 《Journal of Zhejiang University-SCIENCE A》 SCIE EI CAS CSCD 2026年第3期183-199,共17页
Structural optimization plays a crucial role in reducing the cost of offshore wind power,particularly in deep-water regions where the weight of jacket foundations increases substantially.However,there is ongoing debat... Structural optimization plays a crucial role in reducing the cost of offshore wind power,particularly in deep-water regions where the weight of jacket foundations increases substantially.However,there is ongoing debate regarding the water-depth range that is suitable for jacket foundations,and the threshold where floating foundations become more viable.Existing studies have not quantitatively analyzed how water depth affects jacket foundation mass,and have often struggled to handle the high dimensionality and stringent constraints inherent in jacket foundation optimization problems.In this study,we propose an optimization framework that couples parametric finite element analysis with a genetic algorithm to minimize the mass of jacket foundations based on three actual engineering projects at varying water depths.A novel population initialization strategy incorporating engineering experience-based solutions is introduced to improve convergence efficiency and solution quality.Comparative analysis against preliminary designs and existing offshore wind projects demonstrates the model’s ability to achieve cost-effective solutions,specifically reducing required jacket masses by 18.66%,20.98%,and 17.22%at depths of 30.06,60.23,and 89.81 m,respectively.The results reveal a 122.94%increase in jacket mass—from 1431.28 to 3190.90 t—as water depth increases from 30.06 to 89.81 m.The jacket foundation demonstrates superior cost effectiveness in shallow to moderate water depths,as the unit weight per megawatt(MW)of floating foundations is 97.51%and 35.74%higher at water depths of 60.23 and 89.81 m,respectively.Accordingly,the applicable water-depth threshold between the jacket and floating foundations is estimated to be approximately 100 m.The proposed optimization model offers a novel methodology and practical insights for the optimal design of offshore wind turbine support structures in varying marine environments. 展开更多
关键词 Structural optimization Jacket foundation Genetic algorithm Offshore wind power Population initialization Parametric modeling
暂未订购 下载PDF
Federated Multi-Label Feature Selection via Dual-Layer Hybrid Breeding Cooperative Particle Swarm Optimization with Manifold and Sparsity Regularization 认领 引用
16
作者 Songsong Zhang Huazhong Jin +5 位作者 Zhiwei Ye Jia Yang Jixin Zhang Dongfang Wu Xiao Zheng Dingfeng Song 《Computers, Materials & Continua》 SCIE EI 2026年第1期1141-1159,共19页
Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant chal... Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics. 展开更多
关键词 Multi-label feature selection federated learning manifold regularization sparse constraints hybrid breeding optimization algorithm particle swarm optimizatio algorithm privacy protection
暂未订购 下载PDF
Structural Optimization of a Multi-Story Frame Structure Based on a Pre-Trained Physics-Informed Neural Network(PINN)Surrogate Model 认领 引用
17
作者 An Xu Zhixiong Liu +4 位作者 Hua Rong Liang Han Wei Shi Jun Huang Jiyang Fu 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第4期279-313,共35页
In structural optimization,data-driven surrogate models are often explored as alternatives to finite element analysis to reduce computational cost.However,conventional neural networks usually fail to capture key struc... In structural optimization,data-driven surrogate models are often explored as alternatives to finite element analysis to reduce computational cost.However,conventional neural networks usually fail to capture key structural characteristics and are limited to predicting global responses(e.g.,top displacement),but usually fail to achieve accurate internal force predictions with conventional training data volumes.As a result,most existing studies involving surrogate models did not concern internal force constraints.To address this issue,this study proposes a structural optimization framework based on a pre-trained Physics-Informed Neural Network(PINN)surrogate model.By embedding static equilibrium equation into the loss function,the model achieves higher predictive accuracy,particularly for internal forces,while pre-training accelerates convergence and enhances stability.Combined with an improved multi-swarm particle swarm optimization(MPSO)algorithm,the framework enables efficient optimization of multi-story frame structures under internal force and multiple other constraints.The application to a six-story frame structure validates its effectiveness:compared with a DNN-based model,the PINN-based model improves the coefficient of determination for internal force prediction from 0.8874 to 0.9937.These results demonstrate that the proposed method offers a promising approach for efficient optimization of multi-story frame structures. 展开更多
关键词 Structural optimization intelligent algorithms physics-informed neural networks(PINN) neural networks
暂未订购 下载PDF
A data-driven flight optimization of two-segment flapping-wing aircraft based on deep learning 认领 引用
18
作者 Chi Gan Song Chen +1 位作者 Zhouteng Ye Guanxin Hong 《Theoretical & Applied Mechanics Letters》 EI CAS CSCD 2026年第2期30-41,共12页
Flapping-wing aircraft,as a typical example of bionic aviation vehicles,hold significant importance in fields such as environmental monitoring,reconnaissance,and aerobiology research.However,the design of flapping-win... Flapping-wing aircraft,as a typical example of bionic aviation vehicles,hold significant importance in fields such as environmental monitoring,reconnaissance,and aerobiology research.However,the design of flapping-wing aircrafts usually relies on the imitation of birds or insects in nature and requires extensive iterative optimization.In this study,a computational fluid dynamics(CFD)data-driven flight optimization approach is developed for flapping-wing aircraft design.First,we conduct a bionic aerodynamic analysis of the unsteady flow field during the flapping motions and multiple cases with different combinations of flight parameters are simulated via CFD to investigate the factors influencing the flight performance.The simulation data are subsequently used to establish a deep neural network model to explore the relationship between the flapping motions and the flight performance.Finally,optimization algorithms are applied to search for the optimal flight parameter combinations under different weights,which can provide a valuable reference for the overall design and flight optimization of flapping-wing aircraft. 展开更多
关键词 Flapping-wing aircraft Computational fluid dynamics Unsteady flow Neural network Optimization algorithm
暂未订购 下载PDF
Intelligent identification for discrete memristive neuron map:An adaptive chaos game optimization algorithm studied from the perspectives of different sample sizes and objective functions 认领 引用
19
作者 Yuexi Peng Xinyi Luo +2 位作者 Zhijun Li Mengjiao Wang Minglin Ma 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第6期276-291,共16页
Discrete memristive neuron systems have attracted considerable attention due to their nonlinear dynamical properties,low computational overhead,and ease of hardware implementation.For the practical engineering applica... Discrete memristive neuron systems have attracted considerable attention due to their nonlinear dynamical properties,low computational overhead,and ease of hardware implementation.For the practical engineering applications of discrete memristive neuron systems,effective control remains a key issue.Parameter identification using intelligent optimization algorithms is an important approach for controlling complex nonlinear systems.However,classical algorithms are prone to falling into local optima and often exhibit high computational complexity,resulting in slow convergence.Therefore,a new algorithm named adaptive chaos game optimization(ACGO)is proposed to address these issues.By introducing a differential evolution mutation strategy and a Cauchy adaptive parameter mechanism,the ACGO algorithm can effectively balance global exploration and local exploitation capabilities.To verify the effectiveness of the proposed algorithm,it is applied to parameter identification in five discrete memristive neuron maps(DMNMs)and compared with seven intelligent optimization algorithms.Simulation results demonstrate that the ACGO algorithm achieves higher accuracy and faster convergence.In addition,an in-depth investigation is conducted into the effects of sample size and objective function on identification performance.The results indicate that setting the sample size to 4 and selecting the mean squared error(MSE)as the objective function can achieve better identification performance and a high level of robustness. 展开更多
关键词 discrete memristive neuron map parameter identification chaos game optimization algorithm sample size
暂未订购 下载PDF
Cooperative Metaheuristics with Dynamic Dimension Reduction for High-Dimensional Optimization Problems 认领 引用
20
作者 Junxiang Li Zhipeng Dong +2 位作者 Ben Han Jianqiao Chen Xinxin Zhang 《Computers, Materials & Continua》 SCIE EI 2026年第1期1484-1502,共19页
Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when ta... Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems. 展开更多
关键词 Dimension reduction modified principal components analysis high-dimensional optimization problems cooperative metaheuristics metaheuristic algorithms
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈