期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到41篇文章
< 1 2 3 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering 认领 引用 被引量：11
1
作者 Taher NIKNAM Babak AMIRI +1 位作者 Javad OLAMAEI Ali AREFI 《Journal of Zhejiang University-SCIENCE A》 SCIE EI CAS 2009年第4期512-519,共8页
The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper prop... The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Ripley's Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms. 展开更多
关键词 Simulated annealing （SA） Data clustering Hybrid evolutionary optimization algorithm K-means clustering Parti-cle swarm optimization （PSO）
暂未订购 下载PDF
A multiobjective evolutionary optimization method based critical rainfall thresholds for debris flows initiation 认领 引用 被引量：4
2
作者 YAN Yan ZHANG Yu +4 位作者 HU Wang GUO Xiao-jun MA Chao WANG Zi-ang ZHANG Qun 《Journal of Mountain Science》 SCIE CSCD 2020年第8期1860-1873,共14页
At present,most researches on the critical rainfall threshold of debris flow initiation use a linear model obtained through regression.With relatively weak fault tolerance,this method not only ignores nonlinear effect... At present,most researches on the critical rainfall threshold of debris flow initiation use a linear model obtained through regression.With relatively weak fault tolerance,this method not only ignores nonlinear effects but also is susceptible to singular noise samples,which makes it difficult to characterize the true quantization relationship of the rainfall threshold.Besides,the early warning threshold determined by statistical parameters is susceptible to negative samples(samples where no debris flow has occurred),which leads to uncertainty in the reliability of the early warning results by the regression curve.To overcome the above limitations,this study develops a data-driven multiobjective evolutionary optimization method that combines an artificial neural network(ANN)and a multiobjective evolutionary optimization implemented by particle swarm optimization(PSO).Firstly,the Pareto optimality method is used to represent the nonlinear and conflicting critical thresholds for the rainfall intensity I and the rainfall duration D.An ANN is used to construct a dual-target(dual-task)predictive surrogate model,and then a PSO-based multiobjective evolutionary optimization algorithm is applied to train the ANN and stochastically search the trained ANN for obtaining the Pareto front of the I-D surrogate prediction model,which is intended to overcome the limitations of the existing linear regression-based threshold methods.Finally,a double early warning curve model that can effectively control the false alarm rate and negative alarm rate of hazard warnings are proposed based on the decision space and target space maps.This study provides theoretical guidance for the early warning and forecasting of debris flows and has strong applicability. 展开更多
关键词 Debris flow Critical rainfall thresholds Multiobjective evolutionary optimization Artificial neural network Pareto optimality
暂未订购 下载PDF
A novel 3-layer mixed cultural evolutionary optimization framework for optimal operation of syngas production in a Texaco coal-water slurry gasifier 认领 引用 被引量：5
3
作者 曹萃文 张亚坤 +3 位作者 于腾 顾幸生 辛忠 李杰 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2015年第9期1484-1501,共18页
Optimizing operational parameters for syngas production of Texaco coal-water slurry gasifier studied in this paper is a complicated nonlinear constrained problem concerning 3 BP(Error Back Propagation) neural networks... Optimizing operational parameters for syngas production of Texaco coal-water slurry gasifier studied in this paper is a complicated nonlinear constrained problem concerning 3 BP(Error Back Propagation) neural networks. To solve this model, a new 3-layer cultural evolving algorithm framework which has a population space, a medium space and a belief space is firstly conceived. Standard differential evolution algorithm(DE), genetic algorithm(GA), and particle swarm optimization algorithm(PSO) are embedded in this framework to build 3-layer mixed cultural DE/GA/PSO(3LM-CDE, 3LM-CGA, and 3LM-CPSO) algorithms. The accuracy and efficiency of the proposed hybrid algorithms are firstly tested in 20 benchmark nonlinear constrained functions. Then, the operational optimization model for syngas production in a Texaco coal-water slurry gasifier of a real-world chemical plant is solved effectively. The simulation results are encouraging that the 3-layer cultural algorithm evolving framework suggests ways in which the performance of DE, GA, PSO and other population-based evolutionary algorithms(EAs) can be improved,and the optimal operational parameters based on 3LM-CDE algorithm of the syngas production in the Texaco coalwater slurry gasifier shows outstanding computing results than actual industry use and other algorithms. 展开更多
关键词 3-Layer mixed cultural evolutionary framework Optimal operation Syngas production Coal-water slurry gasifier
暂未订购 下载PDF
Evolutionary Multitasking With Multiple Knowledge Representations and Elite Vector Guidance for Solving Large-Scale Multi-Objective Optimization Problems 认领 引用
4
作者 Weijie Mai Zhifan Tang +2 位作者 Weili Liu Jinghui Zhong Hu Jin 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2025年第12期2553-2571,共19页
Evolutionary multitasking optimization(EMTO) can obtain beneficial knowledge for the target task from the auxiliary task to improve its performance, which has received extensive attention in scientific research and en... Evolutionary multitasking optimization(EMTO) can obtain beneficial knowledge for the target task from the auxiliary task to improve its performance, which has received extensive attention in scientific research and engineering problems. Nevertheless, faced with the widespread large-scale multi-objective optimization problems(LSMOPs), the existing EMTO literature barely involves the research of LSMOPs. More importantly, these EMTO algorithms often get trapped in local optima when dealing with LSMOPs, resulting in a slow convergence speed, which is worthy of our attention. To this end, this paper proposes an EMTO algorithm dedicated to solving LSMOPs. On the one hand, given the intricate nature of LSMOPs, we propose a knowledge domination-based knowledge transfer mechanism that can flexibly transfer knowledge from multiple knowledge representations, i.e., the information distribution and distribution distance of the task population. On the other hand, we design an elite vector-guided search strategy. Specifically, the generative adversarial network(GAN) model should first be trained within the divided populations. Then, the well-trained model is used to generate a high-quality individual for the target individual. After that, the high-quality individual is combined with the top-performing individual in the current population to find the elite vector corresponding to the target individual. Finally, the elite vector is applied to guide the target individual to accelerate convergence towards the global optimum in the high-dimensional decision space. We conduct comprehensive experimental investigations on two artificial LSMOPs suites and six real-world LSMOPs to validate the efficiency and robustness of the proposed algorithm,through comparative analysis with state-of-the-art peer algorithms. 展开更多
关键词 Elite vector evolutionary multitasking optimization(EMTO) large-scale multi-objective optimization multiple knowledge representations
暂未订购 下载PDF
Two Performance Indicators Assisted Infill Strategy for Expensive Many⁃Objective Optimization 认领 引用
5
作者 Yi Zhao Jianchao Zeng Ying Tan 《Journal of Harbin Institute of Technology(New Series)》 CAS 2025年第5期24-40,共17页
In recent years,surrogate models derived from genuine data samples have proven to be efficient in addressing optimization challenges that are costly or time⁃intensive.However,the individuals in the population become i... In recent years,surrogate models derived from genuine data samples have proven to be efficient in addressing optimization challenges that are costly or time⁃intensive.However,the individuals in the population become indistinguishable as the curse of dimensionality increases in the objective space and the accumulation of surrogate approximated errors.Therefore,in this paper,each objective function is modeled using a radial basis function approach,and the optimal solution set of the surrogate model is located by the multi⁃objective evolutionary algorithm of strengthened dominance relation.The original objective function values of the true evaluations are converted to two indicator values,and then the surrogate models are set up for the two performance indicators.Finally,an adaptive infill sampling strategy that relies on approximate performance indicators is proposed to assist in selecting individuals for real evaluations from the potential optimal solution set.The algorithm is contrasted against several advanced surrogate⁃assisted evolutionary algorithms on two suites of test cases,and the experimental findings prove that the approach is competitive in solving expensive many⁃objective optimization problems. 展开更多
关键词 expensive multi⁃objective optimization problems infill sample strategy evolutionary optimization algorithm
暂未订购 下载PDF
Topology Optimization with Aperiodic Load Fatigue Constraints Based on Bidirectional Evolutionary Structural Optimization 认领 引用 被引量：7
6
作者 Yongxin Li Guoyun Zhou +2 位作者 Tao Chang Liming Yang Fenghe Wu 《Computer Modeling in Engineering & Sciences》 SCIE EI 2022年第1期499-511,共13页
Because of descriptive nonlinearity and computational inefficiency,topology optimization with fatigue life under aperiodic loads has developed slowly.A fatigue constraint topology optimization method based on bidirect... Because of descriptive nonlinearity and computational inefficiency,topology optimization with fatigue life under aperiodic loads has developed slowly.A fatigue constraint topology optimization method based on bidirectional evolutionary structural optimization(BESO)under an aperiodic load is proposed in this paper.In viewof the severe nonlinearity of fatigue damagewith respect to design variables,effective stress cycles are extracted through transient dynamic analysis.Based on the Miner cumulative damage theory and life requirements,a fatigue constraint is first quantified and then transformed into a stress problem.Then,a normalized termination criterion is proposed by approximatemaximum stress measured by global stress using a P-normaggregation function.Finally,optimization examples show that the proposed algorithm can not only meet the requirements of fatigue life but also obtain a reasonable configuration. 展开更多
关键词 Topology optimization bidirectional evolutionary structural optimization aperiodic load fatigue life stress constraint
暂未订购 下载PDF
Stress Relaxation and Sensitivity Weight for Bi-Directional Evolutionary Structural Optimization to Improve the Computational Efficiency and Stabilization on Stress-Based Topology Optimization 认领 引用 被引量：4
7
作者 Chao Ma Yunkai Gao +1 位作者 Yuexing Duan Zhe Liu 《Computer Modeling in Engineering & Sciences》 SCIE EI 2021年第2期715-738,共24页
Stress-based topology optimization is one of the most concerns of structural optimization and receives much attention in a wide range of engineering designs.To solve the inherent issues of stress-based topology optimi... Stress-based topology optimization is one of the most concerns of structural optimization and receives much attention in a wide range of engineering designs.To solve the inherent issues of stress-based topology optimization,many schemes are added to the conventional bi-directional evolutionary structural optimization(BESO)method in the previous studies.However,these schemes degrade the generality of BESO and increase the computational cost.This study proposes an improved topology optimization method for the continuum structures considering stress minimization in the framework of the conventional BESO method.A global stress measure constructed by p-norm function is treated as the objective function.To stabilize the optimization process,both qp-relaxation and sensitivity weight scheme are introduced.Design variables are updated by the conventional BESO method.Several 2D and 3D examples are used to demonstrate the validity of the proposed method.The results show that the optimization process can be stabilized by qp-relaxation.The value of q and p are crucial to reasonable solutions.The proposed sensitivity weight scheme further stabilizes the optimization process and evenly distributes the stress field.The computational efficiency of the proposed method is higher than the previous methods because it keeps the generality of BESO and does not need additional schemes. 展开更多
关键词 Stress-based topology optimization aggregation function stress relaxation sensitivity weight bi-directional evolutionary structural optimization
暂未订购 下载PDF
Interactive Evolutionary Multi-Objective Optimization Algorithm Using Cone Dominance 认领 引用
8
作者 Dalaijargal Purevsuren Saif ur Rehman +2 位作者 Gang Cui Jianmin Bao Nwe Nwe Htay Win 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2015年第6期76-84,共9页
As the number of objectives increases,the performance of the Pareto dominance-based Evolutionary Multi-objective Optimization( EMO) algorithms such as NSGA-II,SPEA2 severely deteriorates due to the drastic increase in... As the number of objectives increases,the performance of the Pareto dominance-based Evolutionary Multi-objective Optimization( EMO) algorithms such as NSGA-II,SPEA2 severely deteriorates due to the drastic increase in the Pareto-incomparable solutions. We propose a sorting method which classifies these incomparable solutions into several ordered classes by using the decision maker's( DM) preference information.This is accomplished by designing an interactive evolutionary algorithm and constructing convex cones. This method allows the DMs to drive the search process toward a preferred region of the Pareto optimal front. The performance of the proposed algorithm is assessed for two,three,and four-objective knapsack problems. The results demonstrate the algorithm ' s ability to converge to the most preferred point. The evaluation and comparison of the results indicate that the proposed approach gives better solutions than that of NSGA-II. In addition,the approach is more efficient compared to NSGA-II in terms of the number of generations required to reach the preferred point. 展开更多
关键词 multi-objective optimization evolutionary optimization preference information pareto dominance cone dominance
暂未订购 下载PDF
A Modified Bi-Directional Evolutionary Structural Optimization Procedure with Variable Evolutionary Volume Ratio Applied to Multi-Objective Topology Optimization Problem 认领 引用 被引量：1
9
作者 Xudong Jiang Jiaqi Ma Xiaoyan Teng 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第4期511-526,共16页
Natural frequency and dynamic stiffness under transient loading are two key performances for structural design related to automotive,aviation and construction industries.This article aims to tackle the multi-objective... Natural frequency and dynamic stiffness under transient loading are two key performances for structural design related to automotive,aviation and construction industries.This article aims to tackle the multi-objective topological optimization problem considering dynamic stiffness and natural frequency using modified version of bi-directional evolutionary structural optimization(BESO).The conventional BESO is provided with constant evolutionary volume ratio(EVR),whereas low EVR greatly retards the optimization process and high EVR improperly removes the efficient elements.To address the issue,the modified BESO with variable EVR is introduced.To compromise the natural frequency and the dynamic stiffness,a weighting scheme of sensitivity numbers is employed to form the Pareto solution space.Several numerical examples demonstrate that the optimal solutions obtained from the modified BESO method have good agreement with those from the classic BESO method.Most importantly,the dynamic removal strategy with the variable EVR sharply springs up the optimization process.Therefore,it is concluded that the modified BESO method with variable EVR can solve structural design problems using multi-objective optimization. 展开更多
关键词 Bi-directional evolutionary structural optimization variable evolutionary volume ratio multi-objective optimization weighted sum topology optimization
暂未订购 下载PDF
A Smooth Bidirectional Evolutionary Structural Optimization of Vibrational Structures for Natural Frequency and Dynamic Compliance 认领 引用
10
作者 Xiaoyan Teng Qiang Li Xudong Jiang 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第6期2479-2496,共18页
A smooth bidirectional evolutionary structural optimization(SBESO),as a bidirectional version of SESO is proposed to solve the topological optimization of vibrating continuum structures for natural frequencies and dyn... A smooth bidirectional evolutionary structural optimization(SBESO),as a bidirectional version of SESO is proposed to solve the topological optimization of vibrating continuum structures for natural frequencies and dynamic compliance under the transient load.A weighted function is introduced to regulate the mass and stiffness matrix of an element,which has the inefficient element gradually removed from the design domain as if it were undergoing damage.Aiming at maximizing the natural frequency of a structure,the frequency optimization formulation is proposed using the SBESO technique.The effects of various weight functions including constant,linear and sine functions on structural optimization are compared.With the equivalent static load(ESL)method,the dynamic stiffness optimization of a structure is formulated by the SBESO technique.Numerical examples show that compared with the classic BESO method,the SBESO method can efficiently suppress the excessive element deletion by adjusting the element deletion rate and weight function.It is also found that the proposed SBESO technique can obtain an efficient configuration and smooth boundary and demonstrate the advantages over the classic BESO technique. 展开更多
关键词 Topology optimization smooth bi-directional evolutionary structural optimization(SBESO) eigenfrequency optimization dynamic stiffness optimization
暂未订购 下载PDF
Structural Optimization of Hatch Cover Based on Bi-directional Evolutionary Structure Optimization and Surrogate Model Method 认领 引用 被引量：3
11
作者 LI Kai YU Yanyun +2 位作者 HE Jingyi ZHAO Decai LIN Yan 《Journal of Shanghai Jiaotong university(Science)》 EI 2018年第4期538-549,共12页
Weight reduction has attracted much attention among ship designers and ship owners.In the present work,based on an improved bi-directional evolutionary structural optimization(BESO) method and surrogate model method,w... Weight reduction has attracted much attention among ship designers and ship owners.In the present work,based on an improved bi-directional evolutionary structural optimization(BESO) method and surrogate model method,we propose a hybrid optimization method for the structural design optimization of beam-plate structures,which covers three optimization levels:dimension optimization,topology optimization and section optimization.The objective of the proposed optimization method is to minimize the weight of design object under a group of constraints.The kernel optimization procedure(KOP) uses BESO to obtain the optimal topology from a ground structure.To deal with beam-plate structures,the traditional BESO method is improved by using cubic box as the unit cell instead of solid unit to construct periodic lattice structure.In the first optimization level,a series of ground structures are generated based on different dimensional parameter combinations,the KOP is performed to all the ground structures,the response surface model of optimal objective values and dimension parameters is created,and then the optimal dimension parameters can be obtained.In the second optimization level,the optimal topology is obtained by using the KOP according to the optimal dimension parameters.In the third optimization level,response surface method(RSM) is used to determine the section parameters.The proposed method is applied to a hatch cover structure design.The locations and shapes of all the structural members are determined from an oversized ground structure.The results show that the proposed method leads to a greater weight saving,compared with the original design and genetic algorithm(GA) based optimization results. 展开更多
关键词 hatch cover structure optimization multi-level optimization hi-directional evolutionary structural optimization response surface method
暂未订购 下载PDF
Robust multi-objective optimization of rolling schedule for tandem cold rolling based on evolutionary direction differential evolution algorithm 认领 引用 被引量：6
12
作者 Yong Li Lei Fang 《Journal of Iron and Steel Research International》 SCIE EI CAS CSCD 2017年第8期795-802,共8页
According to the actual requirements,profile and rolling energy consumption are selected as objective functions of rolling schedule optimization for tandem cold rolling.Because of mechanical wear,roll diameter has som... According to the actual requirements,profile and rolling energy consumption are selected as objective functions of rolling schedule optimization for tandem cold rolling.Because of mechanical wear,roll diameter has some uncertainty during the rolling process,ignoring which will cause poor robustness of rolling schedule.In order to solve this problem,a robust multi-objective optimization model of rolling schedule for tandem cold rolling was established.A differential evolution algorithm based on the evolutionary direction was proposed.The algorithm calculated the horizontal angle of the vector,which was used to choose mutation vector.The chosen vector contained converging direction and it changed the random mutation operation in differential evolution algorithm.Efficiency of the proposed algorithm was verified by two benchmarks.Meanwhile,in order to ensure that delivery thicknesses have descending order like actual rolling schedule during evolution,a modified Latin Hypercube Sampling process was proposed.Finally,the proposed algorithm was applied to the model above.Results showed that profile was improved and rolling energy consumption was reduced compared with the actual rolling schedule.Meanwhile,robustness of solutions was ensured. 展开更多
关键词 Robust multi-objective optimization Rolling schedule Evolutionary direction Horizontal angle Mutation vector
暂未订购 下载PDF
Al-Biruni Earth Radius(BER)Metaheuristic Search Optimization Algorithm 认领 引用 被引量：3
13
作者 El-Sayed M.El-kenawy Abdelaziz A.Abdelhamid +5 位作者 Abdelhameed Ibrahim Seyedali Mirjalili Nima Khodadad Mona A.Al duailij Amel Ali Alhussan Doaa Sami Khafaga 《Computer Systems Science & Engineering》 SCIE EI 2023年第5期1917-1934,共18页
Metaheuristic optimization algorithms present an effective method for solving several optimization problems from various types of applications and fields.Several metaheuristics and evolutionary optimization algorithms... Metaheuristic optimization algorithms present an effective method for solving several optimization problems from various types of applications and fields.Several metaheuristics and evolutionary optimization algorithms have been emerged recently in the literature and gained widespread attention,such as particle swarm optimization(PSO),whale optimization algorithm(WOA),grey wolf optimization algorithm(GWO),genetic algorithm(GA),and gravitational search algorithm(GSA).According to the literature,no one metaheuristic optimization algorithm can handle all present optimization problems.Hence novel optimization methodologies are still needed.The Al-Biruni earth radius(BER)search optimization algorithm is proposed in this paper.The proposed algorithm was motivated by the behavior of swarm members in achieving their global goals.The search space around local solutions to be explored is determined by Al-Biruni earth radius calculation method.A comparative analysis with existing state-of-the-art optimization algorithms corroborated the findings of BER’s validation and testing against seven mathematical optimization problems.The results show that BER can both explore and avoid local optima.BER has also been tested on an engineering design optimization problem.The results reveal that,in terms of performance and capability,BER outperforms the performance of state-of-the-art metaheuristic optimization algorithms. 展开更多
关键词 Metaheuristics evolutionary optimization exploration exploitation mutation Al-biruni earth radius
暂未订购 下载PDF
Multi-Objective Optimization Algorithm for Grouping Decision Variables Based on Extreme Point Pareto Frontier 认领 引用 被引量：1
14
作者 JunWang Linxi Zhang +4 位作者 Hao Zhang Funan Peng Mohammed A.El-Meligy Mohamed Sharaf Qiang Fu 《Computers, Materials & Continua》 SCIE EI 2024年第4期1281-1299,共19页
The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly... The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently. 展开更多
关键词 Multi-objective evolutionary optimization algorithm decision variables grouping extreme point pareto frontier
暂未订购 下载PDF
SD-KRE:A Method for Structural Decoupling and Knowledge Reuse Evolution of Reinforcement Learning Reward Functions Assisted by Large Language Models 认领 引用
15
作者 Yuqing Cao Xiliang Chen +4 位作者 Legui Zhang Jun Lai Haoyang Dong Xuefei Sun Xiaoyan Wang 《Computers, Materials & Continua》 SCIE EI 2026年第10期2366-2386,共21页
The design of reward functions is crucial to the success of reinforcement learning,yet the process often relies on expert experience and is difficult to debug.Although large language models(LLMs)offer new opportunitie... The design of reward functions is crucial to the success of reinforcement learning,yet the process often relies on expert experience and is difficult to debug.Although large language models(LLMs)offer new opportunities for automated reward design,existing methods still face challenges such as poor interpretability,inability to reuse knowledge,and optimization blindness.To address these issues,this paper proposes a method for structural decoupling and knowledge reuse evolution,referred to as SD-KRE.Its core lies in treating the reward function as a composition of multiple structured units with clear semantics and functionally decoupled components,and in measuring the importance of each unit’s utility through a multi-dimensional quantitative evaluation method;The quantified structural units are stored in a structured reward prior knowledge base and serve as prior knowledge to guide the LLM in targeted reuse and evolutionary optimization during subsequent iterations.Experiments on six continuous control and dexterous manipulation benchmarks show SD-KRE significantly outperforms Eureka and Text2Reward in final performance,convergence speed,and stability,while matching or surpassing manually designed rewards on most tasks.Its stronger alignment with human prior knowledge further validates the semantic validity of the approach.By enabling structured reuse and directed evolution,SD-KRE overcomes the blindness and forgetfulness of conventional LLM-based reward design.It delivers expert-level rewards with higher efficiency,providing a reliable plug-and-play solution for complex reinforcement learning tasks. 展开更多
关键词 Reinforcement learning large language models reward design structural decoupling knowledge reuse evolutionary optimization
暂未订购 下载PDF
Feasibility-Guided Constraint-Handling Techniques for Engineering Optimization Problems 认领 引用 被引量：1
16
作者 Muhammad Asif Jan Yasir Mahmood +6 位作者 Hidayat Ullah Khan Wali Khan Mashwani Muhammad Irfan Uddin Marwan Mahmoud Rashida Adeeb Khanum Ikramullah Noor Mast 《Computers, Materials & Continua》 SCIE EI 2021年第6期2845-2862,共18页
The particle swarm optimization(PSO)algorithm is an established nature-inspired population-based meta-heuristic that replicates the synchronizing movements of birds and sh.PSO is essentially an unconstrained algorithm... The particle swarm optimization(PSO)algorithm is an established nature-inspired population-based meta-heuristic that replicates the synchronizing movements of birds and sh.PSO is essentially an unconstrained algorithm and requires constraint handling techniques(CHTs)to solve constrained optimization problems(COPs).For this purpose,we integrate two CHTs,the superiority of feasibility(SF)and the violation constraint-handling(VCH),with a PSO.These CHTs distinguish feasible solutions from infeasible ones.Moreover,in SF,the selection of infeasible solutions is based on their degree of constraint violations,whereas in VCH,the number of constraint violations by an infeasible solution is of more importance.Therefore,a PSO is adapted for constrained optimization,yielding two constrained variants,denoted SF-PSO and VCH-PSO.Both SF-PSO and VCH-PSO are evaluated with respect to ve engineering problems:the Himmelblau’s nonlinear optimization,the welded beam design,the spring design,the pressure vessel design,and the three-bar truss design.The simulation results show that both algorithms are consistent in terms of their solutions to these problems,including their different available versions.Comparison of the SF-PSO and the VCHPSO with other existing algorithms on the tested problems shows that the proposed algorithms have lower computational cost in terms of the number of function evaluations used.We also report our disagreement with some unjust comparisons made by other researchers regarding the tested problems and their different variants. 展开更多
关键词 Constrained evolutionary optimization constraint handling techniques superiority of feasibility violation constraint-handling technique swarm based evolutionary algorithms particle swarm optimization engineering optimization proble
暂未订购 下载PDF
COMPUTER PROGRAM FOR DIRECTED STRUCTURE TOPOLOGY OPTIMIZATION 认领 引用 被引量：2
17
作者 Xianjie Wang Xun'an Zhang Kepeng Cheng 《Acta Mechanica Solida Sinica》 SCIE EI CSCD 2015年第4期431-440,共10页
To compensate for the imperfection of traditional bi-directional evolutionary structural optimization, material interpolation scheme and sensitivity filter functions are introduced. A suitable filter can overcome the ... To compensate for the imperfection of traditional bi-directional evolutionary structural optimization, material interpolation scheme and sensitivity filter functions are introduced. A suitable filter can overcome the checkerboard and mesh-dependency. And the historical information on accurate elemental sensitivity numbers are used to keep the objective function converging steadily. Apart from rational intervals of the relevant important parameters, the concept of distinguishing between active and non-active elements design is proposed, which can be widely used for improving the function and artistry of structures directly, especially for a one whose accurate size is not given. Furthermore, user-friendly software packages are developed to enhance its accessibility for practicing engineers and architects. And to reduce the time cost for large timeconsuming complex structure optimization, parallel computing is built-in in the MATLAB codes. The program is easy to use for engineers who may not be familiar with either FEA or structure optimization. And developers can make a deep research on the algorithm by changing the MATLAB codes. Several classical examples are given to show that the improved BESO method is superior for its handy and utility computer program software. 展开更多
关键词 bi-directional evolutionary structural optimization （BESO） continuum structurescomputer program development improved algorithm directed structure topology optimizationportion construction design
暂未订购 下载PDF
An Evolutionary Normalization Algorithm for Signed Floating-Point Multiply-Accumulate Operation 认领 引用 被引量：1
18
作者 Rajkumar Sarma Cherry Bhargava Ketan Kotecha 《Computers, Materials & Continua》 SCIE EI 2022年第7期481-495,共15页
In the era of digital signal processing,like graphics and computation systems,multiplication-accumulation is one of the prime operations.A MAC unit is a vital component of a digital system,like different Fast Fourier ... In the era of digital signal processing,like graphics and computation systems,multiplication-accumulation is one of the prime operations.A MAC unit is a vital component of a digital system,like different Fast Fourier Transform(FFT)algorithms,convolution,image processing algorithms,etcetera.In the domain of digital signal processing,the use of normalization architecture is very vast.The main objective of using normalization is to performcomparison and shift operations.In this research paper,an evolutionary approach for designing an optimized normalization algorithm is proposed using basic logical blocks such as Multiplexer,Adder etc.The proposed normalization algorithm is further used in designing an 8×8 bit Signed Floating-Point Multiply-Accumulate(SFMAC)architecture.Since the SFMAC can accept an 8-bit significand and a 3-bit exponent,the input to the said architecture can be somewhere between−(7.96872)10 to+(7.96872)10.The proposed architecture is designed and implemented using the Cadence Virtuoso using 90 and 130 nm technologies(in Generic Process Design Kit(GPDK)and Taiwan Semiconductor Manufacturing Company(TSMC),respectively).To reduce the power consumption of the proposed normalization architecture,techniques such as“block enabling”and“clock gating”are used rigorously.According to the analysis done on Cadence,the proposed architecture uses the least amount of power compared to its current predecessors. 展开更多
关键词 Data normalization cadence virtuoso signed-floating-point MAC evolutionary optimized algorithm block enabling clock gating
暂未订购 下载PDF
New Solution Generation Strategy to Improve Brain Storm Optimization Algorithm for Classification 认领 引用
19
作者 Yu Xue Yan Zhao 《Journal on Internet of Things》 2021年第3期109-118,共10页
As a new intelligent optimization method,brain storm optimization(BSO)algorithm has been widely concerned for its advantages in solving classical optimization problems.Recently,an evolutionary classification optimizat... As a new intelligent optimization method,brain storm optimization(BSO)algorithm has been widely concerned for its advantages in solving classical optimization problems.Recently,an evolutionary classification optimization model based on BSO algorithm has been proposed,which proves its effectiveness in solving the classification problem.However,BSO algorithm also has defects.For example,large-scale datasets make the structure of the model complex,which affects its classification performance.In addition,in the process of optimization,the information of the dominant solution cannot be well preserved in BSO,which leads to its limitations in classification performance.Moreover,its generation strategy is inefficient in solving a variety of complex practical problems.Therefore,we briefly introduce the optimization model structure by feature selection.Besides,this paper retains the brainstorming process of BSO algorithm,and embeds the new generation strategy into BSO algorithm.Through the three generation methods of global optimal,local optimal and nearest neighbor,we can better retain the information of the dominant solution and improve the search efficiency.To verify the performance of the proposed generation strategy in solving the classification problem,twelve datasets are used in experiment.Experimental results show that the new generation strategy can improve the performance of BSO algorithm in solving classification problems. 展开更多
关键词 Brain storm optimization(BSO)algorithm classification generation strategy evolutionary classification optimization
暂未订购 下载PDF
Adaptive backtracking search optimization algorithm with pattern search for numerical optimization 认领 引用 被引量：8
20
作者 Shu Wang Xinyu Da +1 位作者 Mudong Li Tong Han 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2016年第2期395-406,共12页
The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powe... The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts： the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA＇s important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014（IEEE CEC2014） over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm. 展开更多
关键词 evolutionary algorithm backtracking search optimization algorithm（BSA） Hooke-Jeeves pattern search parameter adaption numerical optimization
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 3 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈