期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到56,558篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Improved Artificial Rabbit Optimization Algorithm Fused with Particle Swarm Optimization for Wireless Sensor Network Coverage Optimization 认领 引用 被引量：1
1
作者 WU Jin SU Zhengdong 《Journal of Shanghai Jiaotong university(Science)》 EI 2026年第2期375-389,共15页
Aiming at the problem of low node coverage during node deployment in wireless sensor network(WSN),an improved artificial rabbit optimization algorithm incorporating particle swarm optimization(ARO-PSO)is proposed for ... Aiming at the problem of low node coverage during node deployment in wireless sensor network(WSN),an improved artificial rabbit optimization algorithm incorporating particle swarm optimization(ARO-PSO)is proposed for network coverage optimization.ARO-PSO successfully combines the stochastic characteristics of ARO and the global characteristics of PSO.Firstly,to optimize the quality of the initial population,Sine chaos mapping is introduced to initialize the population;secondly,to better balance the exploration and exploitation,adaptive settings are made;finally,combined with the characteristics of the ARO energy factor,a population decreasing strategy is introduced to further accelerate the convergence speed of the algorithm.Experimental and analytical comparisons are made with ARO and PSO and 6 other excellent optimizers on 13 benchmark functions.The results show that ARO-PSO largely outperforms the original algorithm.Finally,ARO-PSO is applied to WSN coverage optimization experiments in 2D and 3D environments,and the proposed algorithm exhibits higher network coverage and improves the monitoring quality of the network compared to standard ARO and PSO and other state-of-the-art algorithms.The experimental results fully demonstrate the superiority of the ARO-PSO-based WSN node deployment optimization method. 展开更多
关键词 wireless sensor network(WSN) swarm intelligence optimization artificial rabbits optimization(ARO) particle swarm optimization(PSO) coverage optimization
暂未订购 下载PDF
Optimization of the frequency offset increment of FDA-MIMO based on cuckoo search algorithm 认领 引用 被引量：1
2
作者 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 认领 引用
3
作者 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://gffzz188fe103f8f1460asc06f0vuwfxo06nvf.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 认领 引用
4
作者 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://gffzze767f4cc5ce545d8sc06f0vuwfxo06nvf.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 认领 引用
5
作者 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 认领 引用
6
作者 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 认领 引用
7
作者 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
Novel Sea Otter Optimization Algorithm for WSN Coverage Intelligence Optimization 认领 引用
8
作者 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
Experience-guided optimization of jacket foundations for offshore wind turbines in varying water depths based on finite element analysis and the genetic algorithm 认领 引用
9
作者 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
Intelligent identification for discrete memristive neuron map:An adaptive chaos game optimization algorithm studied from the perspectives of different sample sizes and objective functions 认领 引用
10
作者 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
A Review of Genetic Algorithms:Principles, Procedures, and Applications in Optimization 认领 引用
11
作者 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
Painted Wolf Optimization:A Novel Nature-Inspired Metaheuristic Algorithm for Real-World Optimization Problems 认领 引用
12
作者 Saeid Sheikhi 《Computers, Materials & Continua》 SCIE EI 2026年第5期243-271,共29页
Metaheuristic optimization algorithms continue to be essential for solving complex real-world problems,yet existingmethods often struggle with balancing exploration and exploitation across diverse problem landscapes.T... Metaheuristic optimization algorithms continue to be essential for solving complex real-world problems,yet existingmethods often struggle with balancing exploration and exploitation across diverse problem landscapes.This paper proposes a novel nature-inspired metaheuristic optimization algorithm named the Painted Wolf Optimization(PWO)algorithm.The main inspiration for the PWO algorithm is the group behavior and hunting strategy of painted wolves,also known as African wild dogs in the wild,particularly their unique consensus-based voting rally mechanism,a behavior fundamentally distinct fromthe social dynamics of grey wolves.In this innovative process,pack members explore different areas to find prey;then,they hold a pre-hunting voting rally based on the alpha member to determine who will begin the hunt and attack the prey.The efficiency of the proposed PWO algorithm is evaluated by a comparison study with other well-known optimization algorithms on 33 test functions,including the Congress on Evolutionary Computation(CEC)2017 suite and different real-world engineering design cases.Furthermore,the algorithm’s performance is further tested across a spectrum of optimization problems with extensive unknown search spaces.This includes its application within the field of cybersecurity,specifically in the context of training a machine learning-based intrusion detection system(ML-IDS),achieving an accuracy of 0.90 and an F-measure of 0.9290.Statistical analyses using the Wilcoxon signed-rank test(all p<0.05)indicate that the PWO algorithm outperforms existing state-of-the-art algorithms,providing superior solutions in diverse and unpredictable optimization landscapes.This demonstrates its potential as a robust method for tackling complex optimization problems in various fields.The source code for thePWOalgorithmis publicly available at http://gffzz188fe103f8f1460asc06f0vuwfxo06nvf.ffgz.tsg.suse.edu.cn/saeidsheikhi/Painted-Wolf-Optimization. 展开更多
关键词 Optimization painted wolf optimization algorithm metaheuristic algorithm nature-inspired computing swarm intelligence
暂未订购 下载PDF
Gravitational Dynamic Radius Nearest Neighbor Trained by Fuzzy Enhanced Hiking Optimization Algorithm for Imbalanced Data Classification 认领 引用
13
作者 Zahra Beheshti 《Journal of Bionic Engineering》 SCIE EI CSCD 2026年第3期1826-1848,共23页
Imbalanced data classification is one of the most critical challenges in machine learning.Standard classifiers do not provide adequate accuracy for detecting minority samples because these classifiers are biased towar... Imbalanced data classification is one of the most critical challenges in machine learning.Standard classifiers do not provide adequate accuracy for detecting minority samples because these classifiers are biased toward the majority samples.To overcome this drawback,many methods have been proposed.One prominent method is the Gravitational Fixed Radius Nearest Neighbor(GFRNN)algorithm,which applies Newton’s law of universal gravitation to determine the class of a test sample based on two parameters:mass and radius.Although GFRNN shows good performance on some imbalanced datasets,it faces several fundamental problems,including ignoring the data distribution and the improper calculation of radius and mass.In this study,a Gravitational Dynamic Radius Nearest Neighbor trained by a Fuzzy Enhanced Hiking Optimization Algorithm(FEHOA-GDRNN)is proposed to improve GFRNN performance.In FEHOA-GDRNN,Enhanced Hiking Optimization Algorithm(EHOA)applies a new spider web search to find better solution based on a Mamdani Fuzzy Inference System(FIS).FEHOA-GDRNN is evaluated on 40 imbalanced datasets and its results are compared with GDRNN trained by Fuzzy HOA(FHOA-GDRNN),GFRNN trained by HOA(HOA-GFRNN),GFRNN and its various versions(IGFRNN,I-GFRNN,and EGDRNN),Cost-Sensitive Support Vector Machine with an RBF kernel(CS-SVM-RBF),Cost-Sensitive Support Vector Machine with a Linear kernel(CS-SVM-Linear),Cost-Sensitive Naïve Bayes(CS-NB),Binary Decision tree(BDT),Random Forest(RF),Gaussian-Probabilistic Neural Network(GaussianPNN)and Skew-Probabilistic Neural Network(SkewPNN).Moreover,the results of the proposed classifier are compared with those of several Fuzzy K-Nearest Neighbor(FKNN).The results demonstrate that FEHOA-GDRNN outperforms other methods in key metrics,including Average Accuracy(AAcc)and Geometric Mean(GM). 展开更多
关键词 Imbalanced data Classification Gravitational Fixed Radius Nearest Neighbor(GFRNN) Mamdani Fuzzy Inference System Hiking Optimization Algorithm(HOA)
Optimization of Truss Structures Using Nature-Inspired Algorithms with Frequency and Stress Constraints 认领 引用 被引量：1
14
作者 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
PID Steering Control Method of Agricultural Robot Based on Fusion of Particle Swarm Optimization and Genetic Algorithm 认领 引用 被引量：2
15
作者 ZHAO Longlian ZHANG Jiachuang +2 位作者 LI Mei DONG Zhicheng LI Junhui 《农业机械学报》 EI CAS CSCD 北大核心 2026年第1期358-367,共10页
Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion... Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots. 展开更多
关键词 agricultural robot steering PID control particle swarm optimization algorithm genetic algorithm
暂未订购 下载PDF
An Overall Optimization Model Using Metaheuristic Algorithms for the CNN-Based IoT Attack Detection Problem 认领 引用 被引量：1
16
作者 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
Auxiliary-qubit-free quantum approximate optimization algorithm for the minimum dominating set problem 认领 引用
17
作者 Guanghui Li Xiaohui Ni +5 位作者 Junjian Su Sujuan Qin Fenzhuo Guo Bingjie Xu Wei Huang Fei Gao 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第5期326-344,共19页
Quantum approximate optimization algorithm(QAOA)is a promising framework for solving combinatorial optimization problems on near-term quantum devices.One such problem is the minimum dominating set(MDS),which is known ... Quantum approximate optimization algorithm(QAOA)is a promising framework for solving combinatorial optimization problems on near-term quantum devices.One such problem is the minimum dominating set(MDS),which is known to be NP-hard.Existing QAOA algorithms for this problem typically require numerous auxiliary qubits,increasing circuit overhead and hardware requirements.In this paper,we propose an auxiliary-qubit-free QAOA algorithm based on Hamiltonian evolution(AQFH-QAOA)for the MDS problem.Unlike previous studies that require numerous auxiliary qubits,our algorithm eliminates the need for auxiliary qubits,thereby significantly reducing circuit overhead.In addition,we present an auxiliary-qubit-free optimized implementation of the previously proposed Guerrero's QAOA algorithm(AQFG-QAOA)by utilizing gate decomposition techniques.Through a detailed analysis of gate complexity,we evaluate the applicability of these two algorithms.Numerical experiments demonstrate that our proposed algorithm achieves competitive solution quality compared with existing QAOA algorithms,making it a promising candidate for implementation on near-term quantum devices. 展开更多
关键词 quantum algorithm quantum approximate optimization algorithm minimum dominating set Boolean algebra identities
暂未订购 下载PDF
MCPSFOA:Multi-Strategy Enhanced Crested Porcupine-Starfish Optimization Algorithm for Global Optimization and Engineering Design 认领 引用
18
作者 Hao Chen Tong Xu +2 位作者 Yutian Huang Dabo Xin Changting Zhong 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第1期494-545,共52页
Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(... Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(SFOA)is a recently optimizer inspired by swarm intelligence,which is effective for numerical optimization,but it may encounter premature and local convergence for complex optimization problems.To address these challenges,this paper proposes the multi-strategy enhanced crested porcupine-starfish optimization algorithm(MCPSFOA).The core innovation of MCPSFOA lies in employing a hybrid strategy to improve SFOA,which integrates the exploratory mechanisms of SFOA with the diverse search capacity of the Crested Porcupine Optimizer(CPO).This synergy enhances MCPSFOA’s ability to navigate complex and multimodal search spaces.To further prevent premature convergence,MCPSFOA incorporates Lévy flight,leveraging its characteristic long and short jump patterns to enable large-scale exploration and escape from local optima.Subsequently,Gaussian mutation is applied for precise solution tuning,introducing controlled perturbations that enhance accuracy and mitigate the risk of insufficient exploitation.Notably,the population diversity enhancement mechanism periodically identifies and resets stagnant individuals,thereby consistently revitalizing population variety throughout the optimization process.MCPSFOA is rigorously evaluated on 24 classical benchmark functions(including high-dimensional cases),the CEC2017 suite,and the CEC2022 suite.MCPSFOA achieves superior overall performance with Friedman mean ranks of 2.208,2.310 and 2.417 on these benchmark functions,outperforming 11 state-of-the-art algorithms.Furthermore,the practical applicability of MCPSFOA is confirmed through its successful application to five engineering optimization cases,where it also yields excellent results.In conclusion,MCPSFOA is not only a highly effective and reliable optimizer for benchmark functions,but also a practical tool for solving real-world optimization problems. 展开更多
关键词 Global optimization starfish optimization algorithm crested porcupine optimizer metaheuristic Gaussian mutation population diversity enhancement
暂未订购 下载PDF
Propagation Alongside Crossover:An Evolutionary Algorithm for Continuous Optimization and Feature Selection 认领 引用
19
作者 Najibeh Farzi-Veijouyeh Vahideh Sahargahi Neda Matin 《Journal of Bionic Engineering》 SCIE EI CSCD 2026年第2期1112-1175,共64页
Researchers continuously advance optimization algorithms,recognizing that no meta-heuristic can solve all problem types,as stated by the No Free Lunch theorem.This paper introduces the Propagation alongside Crossover(... Researchers continuously advance optimization algorithms,recognizing that no meta-heuristic can solve all problem types,as stated by the No Free Lunch theorem.This paper introduces the Propagation alongside Crossover(PAC)algorithm to address continuous optimization challenges.The primary goal of PAC is to structure the algorithmic phases in a manner that achieves a robust balance between exploration and exploitation through appropriately designed mechanisms at each stage.PAC simultaneously leverages the benefits of propagation,crossover,and mutation.Three independent operators are defined to generate new candidate solutions separately,and a novel selection strategy allows individuals produced by each operator,along with members of the current population,to independently enter the next generation.This design preserves population diversity,prevents all individuals from converging toward a single point,and enhances the algorithm’s ability to explore the solution space effectively.A key innovation of PAC is its three-mode propagation mechanism,which comprises local search,linear propagation toward the target point,and tear-drop shaped propagation toward the target point.Tear-drop propagation provides a precise and adaptive search around promising solutions,increasing diversity and preventing entrapment in local optima.The target point is typically set as the global optimum;however,when propagating the global optimum itself,a random point is used as the target to further enhance exploration and escape from local optima.The initial population is generated using chaotic mapping to ensure broad coverage of the search space.PAC was rigorously evaluated on 51 benchmark functions and three engineering problems,considering scalability,convergence,sensitivity,and computational efficiency.Comparative analyses with established optimization algorithms demonstrate PAC’s superior performance,as confirmed by Wilcoxon signed-rank and Friedman statistical tests.Furthermore,PAC was applied as a feature selection method on four diverse datasets,achieving substantial dimensionality reduction while outperforming comparative methods in classification accuracy.These results highlight PAC’s versatility,robustness,and practical effectiveness. 展开更多
关键词 Optimization algorithms Meta-heuristic algorithms Continuous optimization Propagation alongside crossover algorithm Intrusion detection
Pigeon-Inspired Optimization Algorithm:Definition,Variants,and Its Applications in Unmanned Aerial Vehicles 认领 引用
20
作者 Yu-Xuan Zhou Kai-Qing Zhou +2 位作者 Wei-Lin Chen Zhou-Hua Liao Di-Wen Kang 《Computers, Materials & Continua》 SCIE EI 2026年第4期186-225,共40页
ThePigeon-InspiredOptimization(PIO)algorithmconstitutes ametaheuristic method derived fromthe homing behaviour of pigeons.Initially formulated for three-dimensional path planning in unmanned aerial vehicles(UAVs),the ... ThePigeon-InspiredOptimization(PIO)algorithmconstitutes ametaheuristic method derived fromthe homing behaviour of pigeons.Initially formulated for three-dimensional path planning in unmanned aerial vehicles(UAVs),the algorithmhas attracted considerable academic and industrial interest owing to its effective balance between exploration and exploitation,coupled with advantages in real-time performance and robustness.Nevertheless,as applications have diversified,limitations in convergence precision and a tendency toward premature convergence have become increasingly evident,highlighting a need for improvement.This reviewsystematically outlines the developmental trajectory of the PIO algorithm,with a particular focus on its core applications in UAV navigation,multi-objective formulations,and a spectrum of variantmodels that have emerged in recent years.It offers a structured analysis of the foundational principles underlying the PIO.It conducts a comparative assessment of various performance-enhanced versions,including hybrid models that integrate mechanisms from other optimization paradigms.Additionally,the strengths andweaknesses of distinct PIOvariants are critically examined frommultiple perspectives,including intrinsic algorithmic characteristics,suitability for specific application scenarios,objective function design,and the rigor of the statistical evaluation methodologies employed in empirical studies.Finally,this paper identifies principal challenges within current PIO research and proposes several prospective research directions.Future work should focus on mitigating premature convergence by refining the two-phase search structure and adjusting the exponential decrease of individual numbers during the landmark operator.Enhancing parameter adaptation strategies,potentially using reinforcement learning for dynamic tuning,and advancing theoretical analyses on convergence and complexity are also critical.Further applications should be explored in constrained path planning,Neural Architecture Search(NAS),and other real-worldmulti-objective problems.For Multi-objective PIO(MPIO),key improvements include controlling the growth of the external archive and designing more effective selection mechanisms to maintain convergence efficiency.These efforts are expected to strengthen both the theoretical foundation and practical versatility of PIO and its variants. 展开更多
关键词 Pigeon-inspired optimization metaheuristic algorithm algorithmvariants swarmintelligence variants UAVs convergence analysis
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈