期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到52,285篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Enhanced Heap-Based Optimizer Algorithm for Solving Team Formation Problem 认领 引用
1
作者 Nashwa Nageh Ahmed Elshamy +2 位作者 Abdel Wahab Said Hassan Mostafa Sami Mustafa Abdul Salam 《Computers, Materials & Continua》 SCIE EI 2022年第12期5245-5268,共24页
Team Formation(TF)is considered one of the most significant problems in computer science and optimization.TF is defined as forming the best team of experts in a social network to complete a task with least cost.Many r... Team Formation(TF)is considered one of the most significant problems in computer science and optimization.TF is defined as forming the best team of experts in a social network to complete a task with least cost.Many real-world problems,such as task assignment,vehicle routing,nurse scheduling,resource allocation,and airline crew scheduling,are based on the TF problem.TF has been shown to be a Nondeterministic Polynomial time(NP)problem,and high-dimensional problem with several local optima that can be solved using efficient approximation algorithms.This paper proposes two improved swarm-based algorithms for solving team formation problem.The first algorithm,entitled Hybrid Heap-Based Optimizer with Simulated Annealing Algorithm(HBOSA),uses a single crossover operator to improve the performance of a standard heap-based optimizer(HBO)algorithm.It also employs the simulated annealing(SA)approach to improve model convergence and avoid local minima trapping.The second algorithm is the Chaotic Heap-based Optimizer Algorithm(CHBO).CHBO aids in the discovery of new solutions in the search space by directing particles to different regions of the search space.During HBO’s optimization process,a logistic chaotic map is used.The performance of the two proposed algorithms(HBOSA)and(CHBO)is evaluated using thirteen benchmark functions and tested in solving the TF problem with varying number of experts and skills.Furthermore,the proposed algorithms were compared to well-known optimization algorithms such as the Heap-Based Optimizer(HBO),Developed Simulated Annealing(DSA),Particle SwarmOptimization(PSO),GreyWolfOptimization(GWO),and Genetic Algorithm(GA).Finally,the proposed algorithms were applied to a real-world benchmark dataset known as the Internet Movie Database(IMDB).The simulation results revealed that the proposed algorithms outperformed the compared algorithms in terms of efficiency and performance,with fast convergence to the global minimum. 展开更多
关键词 Team formation problem optimization problem genetic algorithm heap-based optimizer simulated annealing hybridization method chaotic local search
暂未订购 下载PDF
Novel Sea Otter Optimization Algorithm for WSN Coverage Intelligence Optimization 认领 引用 被引量：2
2
作者 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
Optimization of the frequency offset increment of FDA-MIMO based on cuckoo search algorithm 认领 引用 被引量：2
3
作者 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 认领 引用
4
作者 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://gffzz188fe103f8f1460asq0fcc9fvqo9c6cbo.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 认领 引用
5
作者 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://gffzze767f4cc5ce545d8sq0fcc9fvqo9c6cbo.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 认领 引用
6
作者 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
Grey Wolf Optimizer for Cluster-Based Routing in Wireless Sensor Networks:A Methodological Survey 认领 引用
7
作者 Mohammad Shokouhifar Fakhrosadat Fanian +4 位作者 Mehdi Hosseinzadeh Aseel Smerat Kamal M.Othman Abdulfattah Noorwali Esam Y.O.Zafar 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第1期191-255,共65页
Wireless Sensor Networks(WSNs)have become foundational in numerous real-world applications,ranging from environmental monitoring and industrial automation to healthcare systems and smart city development.As these netw... Wireless Sensor Networks(WSNs)have become foundational in numerous real-world applications,ranging from environmental monitoring and industrial automation to healthcare systems and smart city development.As these networks continue to grow in scale and complexity,the need for energy-efficient,scalable,and robust communication protocols becomes more critical than ever.Metaheuristic algorithms have shown significant promise in addressing these challenges,offering flexible and effective solutions for optimizing WSN performance.Among them,the Grey Wolf Optimizer(GWO)algorithm has attracted growing attention due to its simplicity,fast convergence,and strong global search capabilities.Accordingly,this survey provides an in-depth review of the applications of GWO and its variants for clustering,multi-hop routing,and hybrid cluster-based routing in WSNs.We categorize and analyze the existing GWO-based approaches across these key network optimization tasks,discussing the different problem formulations,decision variables,objective functions,and performance metrics used.In doing so,we examine standard GWO,multi-objective GWO,and hybrid GWO models that incorporate other computational intelligence techniques.Each method is evaluated based on how effectively it addresses the core constraints of WSNs,including energy consumption,communication overhead,and network lifetime.Finally,this survey outlines existing gaps in the literature and proposes potential future research directions aimed at enhancing the effectiveness and real-world applicability of GWO-based techniques for WSN clustering and routing.Our goal is to provide researchers and practitioners with a clear,structured understanding of the current state of GWO in WSNs and inspire further innovation in this evolving field. 展开更多
关键词 Wireless sensor networks data transmission energy efficiency lifetime clustering routing optimization metaheuristic algorithms grey wolf optimizer
暂未订购 下载PDF
A Metaheuristic Football Optimization Algorithm Integrated with Large Language Models for Automated Seismic Time-Series Modeling 认领 引用
8
作者 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 认领 引用
9
作者 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
Collaborative optimization of well operations and adjustment strategies in waterflooding reservoirs using an enhanced adaptive differential evolution algorithm 认领 引用
10
作者 Xian-Min Zhang Jian-Gang Yang +2 位作者 Qi-Hong Feng Ya-Wei Hou Lei Zhang 《Petroleum Science》 SCIE EI CAS CSCD 2026年第5期2735-2757,共23页
Efficient optimization of well operations andadjustment strategies in large-scale waterflooding reservoirs is a high-dimensional and complex challenge due to strong decision coupling and reservoir heterogeneity.This s... Efficient optimization of well operations andadjustment strategies in large-scale waterflooding reservoirs is a high-dimensional and complex challenge due to strong decision coupling and reservoir heterogeneity.This study proposes a collaborative optimization framework that integrates multiple adjustment strategies,includinginfillwell drilling,shut-in of low-efficiency wells,and injectionproduction well conversion.A penalty mechanism is introduced tobalance cumulative oil production maximization with minimum production constraints for infill wells.The core contribution is the development of a multi-strategy enhancedadaptive differential evolution algorithm(E-ADE),which incorporates the follower update mechanism of the SparrowSearch Algorithm(SSA)and the logarithmic spiral search strategy of the Whale Optimization Algorithm(WOA)into the differential evolution(DE)framework.By dynamically adjusting differential evolution vectors and adaptively regulating population size across optimization stages,E-ADE effectively balances global exploration and local exploitation,leading to significantlyimproved convergence speed and optimization accuracy.Benchmark tests on nine multimodalfunctions demonstrate that E-ADEconsistently outperforms classical algorithms,includingDE,GA,PSO,WOA,and SSA.The method is further applied to the PUNQ-S3 reservoir model and the S4 block of the W12-2 oilfield under high water-cut conditions.The results indicate that E-ADE enables adaptive optimization of infillwell placement,shut-in schemes,and welltype conversions,achieving coordinated improvements in both field-scale production andsingle-well performance,and substantially enhancing the efficiency of waterflooding development. 展开更多
关键词 Waterflooding reservoir Collaborative optimization Enhanced adaptive differential evolution algorithm Logarithmic spiral search Shannon entropy
暂未订购 下载PDF
Experience-guided optimization of jacket foundations for offshore wind turbines in varying water depths based on finite element analysis and the genetic algorithm 认领 引用
11
作者 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
A Comprehensive Review of Barnacles Mating Optimizer:Theoretical Foundation,Variants,Applications,and Future Research Directions 认领 引用
12
作者 Mohammed A.El-Shorbagy Anas Bouaouda Fatma A.Hashim 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第5期41-118,共78页
As real-world optimization problems become more complex,the development of sophisticated and robust algorithms has become essential.Consequently,researchers are focusing on advanced optimizationmethods that efficientl... As real-world optimization problems become more complex,the development of sophisticated and robust algorithms has become essential.Consequently,researchers are focusing on advanced optimizationmethods that efficiently explore the feasible solution space.This involves designing new high-performance algorithms or enhancing existing meta-heuristic methods by integrating advanced evolutionary strategies.Barnacles Mating Optimizer(BMO)is an evolutionary-basedmeta-heuristic algorithminspired by themating behavior of barnacles,incorporating Hardy–Weinberg principles and the sperm-cast mechanism.Introduced in 2020,BMO has attracted significant attention and has been successfully applied across diverse fields due to its simple design,ease of implementation,high flexibility,and efficient convergence.Therefore,this review provides an overview and synthesis of studies employing BMO.It begins with an introduction to BMO,describing its natural inspiration and optimization framework,followed by a discussion of its core operational procedures and theoretical foundations.The paper then presents a comprehensive analysis of recent BMO variants,systematically categorizing them into modified,multi-objective,and hybrid versions.It also examines BMO’s diverse real-world applications,including power and control engineering,classification,image processing,wireless networks,forecasting,and signal processing.In addition,an updated performance evaluation of BMO is provided,comparing its effectiveness against recently published algorithms using the CEC2005 benchmark suite.Key strengths of BMO are highlighted,including its ability to balance exploration and exploitation,adaptability across problem domains,and its potential for hybridization with other optimization algorithms.Finally,potential enhancements and future research directions are outlined,including multi-objective variants,integration with deep learning,and parallel or distributed implementations. 展开更多
关键词 Evolutionary algorithms barnacles mating optimizer meta-heuristics engineering optimization computational intelligence
暂未订购 下载PDF
HERO(Hessian-Engineered Relaxation Optimizer):Suppressing“Hessian Pollution”for Accelerated First-Principles Structural Relaxation 认领 引用
13
作者 Mingzhe Li Piao Ma +2 位作者 Limin Li Weijie Yang Hao Li 《Computers, Materials & Continua》 SCIE EI 2026年第7期266-277,共12页
Structural optimization is a fundamental step in density functional theory(DFT)calculations,typically driven by the Broyden-Fletcher-Goldfarb-Shanno(BFGS)optimizer.However,the standard BFGS algorithm relies on a local... Structural optimization is a fundamental step in density functional theory(DFT)calculations,typically driven by the Broyden-Fletcher-Goldfarb-Shanno(BFGS)optimizer.However,the standard BFGS algorithm relies on a local quadratic approximation of the potential energy surface(PES),which frequently breaks down in highly non-quadratic regimes typical of complex surface adsorption systems and defective bulk materials.This breakdown leads to“Hessian pollution”,a phenomenon where higher-order anharmonicities introduce spurious off-diagonal inter-atomic couplings that distort curvature estimates and significantly stall convergence.Herein,we propose a physics-inspired algorithmic intervention to the BFGS method that systematically suppresses this pollution.Once the maximum residual force drops below a specific activation threshold(e.g.,0.5 or 0.1 eV/Å),our approach conditionally resets all off-diagonal Hessian blocks,and introduces an isotropic background stiffness strategy where these blocks can be repopulated with a small positive constant rather than zeroed completely.This balances the robust stability of diagonal dominance with accelerated convergence speed.Implemented as an add-on to the Atomic Simulation Environment(ASE)Library,the method is lightweight,transferable,and compatible with standard DFT codes.Tests across diverse chemical systems,including atomic and molecular adsorbates(O*,H*,CO*)on Pt(111)surfaces and defective bulk oxides(WO3-x),demonstrate substantial reductions in the number of required force calls without biasing the final optimized geometry.It offers a practical tool for high-throughput DFT workflows that eliminates the need for domain-specific training.This method is available via our open-source package,Hessian-Engineered Relaxation Optimizer(HERO). 展开更多
关键词 Hessian-engineered relaxation optimizer density functional theory(DFT) structural optimization BFGS algorithm hessian pollution structural relaxation
暂未订购 下载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 认领 引用
14
作者 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
Techno-economic co-optimization of CO2enhanced oil recovery strategies in a tight oil reservoir using coupled improved evolutionary algorithm and machine learning framework 认领 引用
15
作者 Shu-Qin Wen Bing Wei +2 位作者 Jun-Yu You Nan-Jiang Leng William Ampomah 《Petroleum Science》 SCIE EI CAS CSCD 2026年第5期2639-2654,共16页
Massive carbon dioxide(CO2)emissions drive climate change.Injecting CO2into unconventional reservoirsachieves both enhanced oil recovery(EOR)and geological sequestration.However,simultaneously optimizing oil exc... Massive carbon dioxide(CO2)emissions drive climate change.Injecting CO2into unconventional reservoirsachieves both enhanced oil recovery(EOR)and geological sequestration.However,simultaneously optimizing oil exchange ratio,CO2storage,and net present value remainschallenging.This study develops an integrated machine learning(ML)-based framework for multi-objective optimization of CO2-EOR.A high-resolution reservoir simulation was constructed from field data,and Latin hypercube sampling generateddiverse scenarios for proxy training.Mantel's test quantified correlations between input parameters and performance metrics,showing that injection strategy strongly controls net present value,whereas geological properties dominate CO2storage.Three ML models—random forest(RF),support vector regression,and artificial neural networks—were evaluated,with RF selected for its superior performance on small datasets.RF was embedded into an improved non-dominatedsorting genetic algorithm II,enhanced with grey difference degree,crowding distance,and adaptive differential evolution to improve diversity and efficiency.Finally,the technique for order preference by similarity to ideal solution ranked Pareto-optimal solutions through integrating oil productivity,storage,and economics.The proposed framework operationalizes simultaneoushigh-efficiency tight oil recovery and field-scale CO2geological storage,delivering quantitative design rules that embed low-carbon practice into upstream operations and advance the energy sector's greenerand sustainable transition. 展开更多
关键词 CO2enhanced oil recovery Multi-objective optimization Improved non-dominated sorting genetic algorithm II Unconventional oil reservoir
暂未订购 下载PDF
Data-Driven Algorithms for Finite-Horizon and Infinite-Horizon Indefinite Linear Quadratic Stochastic Optimal Control Problems 认领 引用
16
作者 Guangchen Wang Heng Zhang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2026年第6期1459-1469,共11页
This paper is devoted to devising data-driven algorithms for finite-horizon and infinite-horizon linear quadratic stochastic optimal control(LQSOC)problems.In our study,the diffusion terms of system dynamics are permi... This paper is devoted to devising data-driven algorithms for finite-horizon and infinite-horizon linear quadratic stochastic optimal control(LQSOC)problems.In our study,the diffusion terms of system dynamics are permitted to hinge upon both control and state variables,and the weighting matrices of cost functionals are allowed to be indefinite.It is acknowledged that the optimal controls of finite-horizon and infinite-horizon indefinite LQSOC problems are correlated with a generalized differential Riccati equation(GDRE)and a generalized algebraic Riccati equation(GARE).Herein,we propose two data-driven algorithms to approximate the solutions of these Riccati equations,and thereby determine optimal controls,without leveraging the information of all system parameters.Additionally,we prove the convergence of these algorithms and examine the impact of computational errors.Finally,we validate the performance of these data-driven algorithms via three simulation examples. 展开更多
关键词 Data-driven algorithm generalized algebraic Riccati equation (GARE) generalized differential Riccati equation (GDRE) indefinite problem linear quadratic stochastic optimal control (LQSOC)
暂未订购 下载PDF
A Review of Genetic Algorithms:Principles, Procedures, and Applications in Optimization 认领 引用
17
作者 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
Multistrategy Improved Aquila Optimizer for Test Case Prioritization 认领 引用
18
作者 Jiali Chen Jiheng Zhang +3 位作者 Xiaojie Chen Chong Zeng Honghui Yi Heming Jia 《Computers, Materials & Continua》 SCIE EI 2026年第8期2328-2362,共35页
Traditional heuristic algorithms often fall into local optima and converge slowly when test case prioritization is addressed in regression testing,making them inadequate for complex real-world scenarios.The Aquila opt... Traditional heuristic algorithms often fall into local optima and converge slowly when test case prioritization is addressed in regression testing,making them inadequate for complex real-world scenarios.The Aquila optimizer,a novel metaheuristic algorithm,demonstrates strong global exploration capability but still faces limitations,including insufficient exploitation capability and slow convergence.To overcome these challenges,a multi-strategy improved chaotic Cauchy inverse cumulative distribution Aquila optimizer for test case prioritization is proposed.First,a logistic–sine–cosine composite chaotic mapping is introduced during the initialization phase of the Aquila optimizer to increase population diversity.Second,the mutated random walk strategy is used to improve global exploration,further enhancing the global search ability of the Aquila optimizer.Moreover,during the narrowed exploration and narrowed exploitation phases,the Cauchy inverse cumulative distribution flight replaces the Lévy flight strategy to reallocate individual positions,strengthening individuals’optimization capability and preventing the algorithm from becoming trapped in local optima.Finally,in the later iteration stage,the specular reflection learning strategy is used to perturb the optimal individual positions and improve the Aquila optimizer’s convergence accuracy and comprehensive optimization performance.Five Java projects were selected from the Defects4J benchmark datasets to conduct comparative experiments with the Aquila optimizer and seven other metaheuristic algorithms.The results demonstrate the effectiveness and superiority of the improved algorithm in test case prioritization.It achieves average improvements of approximately 4.96%in the average percentage of fault detection,3.82%in the average percentage of block coverage,and 5.64%in the average percentage of decision coverage,enabling faster coverage of code blocks and branches.The results provide an efficient priority sorting solution for complex regression testing scenarios. 展开更多
关键词 Heuristic algorithm search-based software engineering(SBSE) Aquila optimizer(AO) test case prioritization(TCP) average percentage of fault detection(APFD) average percentage of block coverage(APBC) average percentage of decision coverage(APDC)
暂未订购 下载PDF
A Firefly Algorithm-Optimized CNN-BiLSTM Model for Automated Detection of Bone Cancer and Marrow Cell Abnormalities 认领 引用
19
作者 Ishaani Priyadarshini 《Computers, Materials & Continua》 SCIE EI 2026年第3期1510-1535,共26页
Early and accurate detection of bone cancer and marrow cell abnormalities is critical for timely intervention and improved patient outcomes.This paper proposes a novel hybrid deep learning framework that integrates a ... Early and accurate detection of bone cancer and marrow cell abnormalities is critical for timely intervention and improved patient outcomes.This paper proposes a novel hybrid deep learning framework that integrates a Convolutional Neural Network(CNN)with a Bidirectional Long Short-Term Memory(BiLSTM)architecture,optimized using the Firefly Optimization algorithm(FO).The proposed CNN-BiLSTM-FO model is tailored for structured biomedical data,capturing both local patterns and sequential dependencies in diagnostic features,while the Firefly Algorithm fine-tunes key hyperparameters to maximize predictive performance.The approach is evaluated on two benchmark biomedical datasets:one comprising diagnostic data for bone cancer detection and another for identifying marrow cell abnormalities.Experimental results demonstrate that the proposed method outperforms standard deep learning models,including CNN,LSTM,BiLSTM,and CNN-LSTM hybrids,significantly.The CNNBiLSTM-FO model achieves an accuracy of 98.55%for bone cancer detection and 96.04%for marrow abnormality classification.The paper also presents a detailed complexity analysis of the proposed algorithm and compares its performance across multiple evaluation metrics such as precision,recall,F1-score,and AUC.The results confirm the effectiveness of the firefly-based optimization strategy in improving classification accuracy and model robustness.This work introduces a scalable and accurate diagnostic solution that holds strong potential for integration into intelligent clinical decision-support systems. 展开更多
关键词 Firefly optimization algorithm(FO) marrow cell abnormalities bidirectional long short term memory(Bi-LSTM) temporal dependency modeling
暂未订购 下载PDF
PID Steering Control Method of Agricultural Robot Based on Fusion of Particle Swarm Optimization and Genetic Algorithm 认领 引用 被引量：4
20
作者 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
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈