期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到324,548篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Deep Learning Mixed Hyper-Parameter Optimization Based on Improved Cuckoo Search Algorithm 认领 引用 被引量：1
1
作者 TONG Yu CHEN Rong HU Biling 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2025年第2期195-204,共10页
Deep learning algorithm is an effective data mining method and has been used in many fields to solve practical problems.However,the deep learning algorithms often contain some hyper-parameters which may be continuous,... Deep learning algorithm is an effective data mining method and has been used in many fields to solve practical problems.However,the deep learning algorithms often contain some hyper-parameters which may be continuous,integer,or mixed,and are often given based on experience but largely affect the effectiveness of activity recognition.In order to adapt to different hyper-parameter optimization problems,our improved Cuckoo Search(CS)algorithm is proposed to optimize the mixed hyper-parameters in deep learning algorithm.The algorithm optimizes the hyper-parameters in the deep learning model robustly,and intelligently selects the combination of integer type and continuous hyper-parameters that make the model optimal.Then,the mixed hyper-parameter in Convolutional Neural Network(CNN),Long-Short-Term Memory(LSTM)and CNN-LSTM are optimized based on the methodology on the smart home activity recognition datasets.Results show that the methodology can improve the performance of the deep learning model and whether we are experienced or not,we can get a better deep learning model using our method. 展开更多
关键词 improved Cuckoo Search algorithm mixed hyper-parameter optimization deep learning
暂未订购 下载PDF
Dual-Objective Mixed Integer Linear Program and Memetic Algorithm for an Industrial Group Scheduling Problem 认领 引用 被引量：13
2
作者 Ziyan Zhao Shixin Liu +1 位作者 MengChu Zhou Abdullah Abusorrah 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2021年第6期1199-1209,共11页
Group scheduling problems have attracted much attention owing to their many practical applications.This work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-de... Group scheduling problems have attracted much attention owing to their many practical applications.This work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-dependent setup time,release time,and due time.It is originated from an important industrial process,i.e.,wire rod and bar rolling process in steel production systems.Two objective functions,i.e.,the number of late jobs and total setup time,are minimized.A mixed integer linear program is established to describe the problem.To obtain its Pareto solutions,we present a memetic algorithm that integrates a population-based nondominated sorting genetic algorithm II and two single-solution-based improvement methods,i.e.,an insertion-based local search and an iterated greedy algorithm.The computational results on extensive industrial data with the scale of a one-week schedule show that the proposed algorithm has great performance in solving the concerned problem and outperforms its peers.Its high accuracy and efficiency imply its great potential to be applied to solve industrial-size group scheduling problems. 展开更多
关键词 Insertion-based local search iterated greedy algorithm machine learning memetic algorithm nondominated sorting genetic algorithm II(NSGA-II) production scheduling
暂未订购 下载PDF
Sequencing Mixed-model Production Systems by Modified Multi-objective Genetic Algorithms 认领 引用 被引量：6
3
作者 WANG Binggang 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS 2010年第5期537-546,共10页
As two independent problems,scheduling for parts fabrication line and sequencing for mixed-model assembly line have been addressed respectively by many researchers.However,these two problems should be considered simul... As two independent problems,scheduling for parts fabrication line and sequencing for mixed-model assembly line have been addressed respectively by many researchers.However,these two problems should be considered simultaneously to improve the efficiency of the whole fabrication/assembly systems.By far,little research effort is devoted to sequencing problems for mixed-model fabrication/assembly systems.This paper is concerned about the sequencing problems in pull production systems which are composed of one mixed-model assembly line with limited intermediate buffers and two flexible parts fabrication flow lines with identical parallel machines and limited intermediate buffers.Two objectives are considered simultaneously：minimizing the total variation in parts consumption in the assembly line and minimizing the total makespan cost in the fabrication/assembly system.The integrated optimization framework,mathematical models and the method to construct the complete schedules for the fabrication lines according to the production sequences for the first stage in fabrication lines are presented.Since the above problems are non-deterministic polynomial-hard（NP-hard）,a modified multi-objective genetic algorithm is proposed for solving the models,in which a method to generate the production sequences for the fabrication lines from the production sequences for the assembly line and a method to generate the initial population are put forward,new selection,crossover and mutation operators are designed,and Pareto ranking method and sharing function method are employed to evaluate the individuals＇ fitness.The feasibility and efficiency of the multi-objective genetic algorithm is shown by computational comparison with a multi-objective simulated annealing algorithm.The sequencing problems for mixed-model production systems can be solved effectively by the proposed modified multi-objective genetic algorithm. 展开更多
关键词 mixed-model production system sequencing parallel machine buffers multi-objective genetic algorithm multi-objective simulated annealing algorithm
暂未订购 下载PDF
The improved artificial bee colony algorithm for mixed additive and multiplicative random error model and the bootstrap method for its precision estimation 认领 引用 被引量：5
4
作者 Leyang Wang Shuhao Han 《Geodesy and Geodynamics》 EI CSCD 2023年第3期244-253,共10页
To solve the complex weight matrix derivative problem when using the weighted least squares method to estimate the parameters of the mixed additive and multiplicative random error model(MAM error model),we use an impr... To solve the complex weight matrix derivative problem when using the weighted least squares method to estimate the parameters of the mixed additive and multiplicative random error model(MAM error model),we use an improved artificial bee colony algorithm without derivative and the bootstrap method to estimate the parameters and evaluate the accuracy of MAM error model.The improved artificial bee colony algorithm can update individuals in multiple dimensions and improve the cooperation ability between individuals by constructing a new search equation based on the idea of quasi-affine transformation.The experimental results show that based on the weighted least squares criterion,the algorithm can get the results consistent with the weighted least squares method without multiple formula derivation.The parameter estimation and accuracy evaluation method based on the bootstrap method can get better parameter estimation and more reasonable accuracy information than existing methods,which provides a new idea for the theory of parameter estimation and accuracy evaluation of the MAM error model. 展开更多
关键词 Mixed additive and multiplicative random error Parameter estimation Accuracy evaluation Artificial bee colony algorithm Bootstrap method
暂未订购 下载PDF
A PROJECTION-TYPE ALGORITHM FOR SOLVING GENERALIZED MIXED VARIATIONAL INEQUALITIES 认领 引用 被引量：2
5
作者 涂凯 夏福全 《Acta Mathematica Scientia》 SCIE CSCD 2016年第6期1619-1630,共12页
We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping... We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping is continuous and f-pseudomonotone with nonempty compact convex values on dom（f）, where f ： Rn --RU{＋∞} is a proper func- tion. The algorithm presented in this paper generalize and improve some known algorithms in literatures. Preliminary computational experience is also reported. 展开更多
关键词 projection-type algorithm generalized mixed variational inequality f-pseudo-monotone mapping
暂未订购 下载PDF
Sequencing of Mixed Model Assembly Lines Based on Improved Shuffled Frog Leaping Algorithm 认领 引用 被引量：1
6
作者 ZHAO Xiaoqiang JI Shurong 《Journal of Donghua University(English Edition)》 CAS 2018年第2期154-159,共6页
Shuffled frog leaping algorithm( SFLA) was used to solve multi-objective sequencing problem of mixed model assembly line( MMAL). Local convergence can be avoided and optimal solution can be obtained to a certain exten... Shuffled frog leaping algorithm( SFLA) was used to solve multi-objective sequencing problem of mixed model assembly line( MMAL). Local convergence can be avoided and optimal solution can be obtained to a certain extent. However,the multi-objective sequencing problem of MMAL is an non-deterministic polynomial hard( NP-hard) problem and the shortcomings are slow convergence rate and low precision. To solve the shortcomings for optimization objectives of minimizing total utility time and keeping average consumption rate of parts, a chaos differential evolution SFLA( CDESFLA) is proposed in this study. Because SFLA is easy to fall into local optimum,the evolution operator of differential evolution algorithms is introduced in SFLA as a local search strategy,and differential mutation operator is introduced in chaotic sequence to prevent premature convergence. The examples show that the proposed CDESFLA is better for convergence accuracy than SFLA,genetic algorithm( GA) and particle swarm optimization( PSO) 展开更多
关键词 mixed model assembly line (MMAL) sequencing shuffledfrog leaping algorithm (SFLA) chaos optimization differentialevolution algorithm
暂未订购 下载PDF
An Improved Genetic Algorithm for Solving the Mixed⁃Flow Job⁃Shop Scheduling Problem with Combined Processing Constraints 认领 引用 被引量：4
7
作者 ZHU Haihua ZHANG Yi +2 位作者 SUN Hongwei LIAO Liangchuang TANG Dunbing 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2021年第3期415-426,共12页
The flexible job-shop scheduling problem(FJSP)with combined processing constraints is a common scheduling problem in mixed-flow production lines.However,traditional methods for classic FJSP cannot be directly applied.... The flexible job-shop scheduling problem(FJSP)with combined processing constraints is a common scheduling problem in mixed-flow production lines.However,traditional methods for classic FJSP cannot be directly applied.Targeting this problem,the process state model of a mixed-flow production line is analyzed.On this basis,a mathematical model of a mixed-flow job-shop scheduling problem with combined processing constraints is established based on the traditional FJSP.Then,an improved genetic algorithm with multi-segment encoding,crossover,and mutation is proposed for the mixed-flow production line problem.Finally,the proposed algorithm is applied to the production workshop of missile structural components at an aerospace institute to verify its feasibility and effectiveness. 展开更多
关键词 mixed-flow production flexible job-shop scheduling problem(FJSP) genetic algorithm encoding
暂未订购 下载PDF
Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems 认领 引用 被引量：4
8
作者 Li Hecheng Wang Yuping 《Journal of Systems Engineering and Electronics》 SCIE EI 2008年第6期1157-1164,共8页
Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower＇s functions are separable with respect to the follower＇s variables, and the other is that the follower＇s f... Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower＇s functions are separable with respect to the follower＇s variables, and the other is that the follower＇s functions are convex if the follower＇s variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader＇s variable x, it is proved that the optimal solution y of the follower＇s mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower＇s programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter λ, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust. 展开更多
关键词 mixed-integer nonlinear bilevel programming genetic algorithm exponential distribution optimalsolutions
暂未订购 下载PDF
ALGORITHMS FOR A SYSTEM OF GENERALIZED MIXED EQUILIBRIUM PROBLEMS AND A COUNTABLE FAMILY OF SOME NONLINEAR MULTI-VALUED NONEXPANSIVE-TYPE MAPS 认领 引用
9
作者 Ogonnaya Michael ROMANUS Ukamaka Victoria NNYABA Monday Ogudu NNAKWE 《Acta Mathematica Scientia》 SCIE CSCD 2018年第6期1805-1820,共16页
In this paper, relaxed iterative algorithms of Krasnoselskii-type and Halpern-type that approximate a solution of a system of a generalized mixed equilibrium problem anda common fixed point of a countable family of to... In this paper, relaxed iterative algorithms of Krasnoselskii-type and Halpern-type that approximate a solution of a system of a generalized mixed equilibrium problem anda common fixed point of a countable family of totally quasi-C-asymptotically nonexpansivemulti-valued maps are constructed. Strong convergence of the sequence generated by thesealgorithms is proved in uniformly smooth and strictly convex real Banach spaces with Kadec-Klee property. Furthermore, several applications of our theorems are also presented. Finally,our theorems are significant improvements on several important recent results for this classof nonlinear problems. 展开更多
关键词 Halpern-type algorithm Krasnoselskii-type algorithm system of generalizedmixed equilibrium problems totally quasi-C-asymptotically nonexpansive multi-valued maps equally continuous maps
暂未订购 下载PDF
PREDICTOR-CORRECTOR ALGORITHMS FOR SOLVING GENERALIZED MIXED IMPLICIT QUASI-EQUILIBRIUM PROBLEMS 认领 引用
10
作者 丁协平 林炎诚 姚任之 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2006年第9期1157-1164,共8页
A new class of generalized mixed implicit quasi-equilibrium problems （GMIQEP） with four-functions is introduced and studied. The new class of equilibrium problems includes many known generalized equilibrium problems... A new class of generalized mixed implicit quasi-equilibrium problems （GMIQEP） with four-functions is introduced and studied. The new class of equilibrium problems includes many known generalized equilibrium problems and generalized mixed implicit quasi-variational inequality problems as many special cases. By employing the auxiliary principle technique, some predictor-corrector iterative algorithms for solving the GMIQEP are suggested and analyzed. The convergence of the suggested algorithm only requires the continuity and the partially relaxed implicit strong monotonicity of the mappings 展开更多
关键词 generalized mixed implicit quasi-equilibrium problem auxiliary variational inequality predictor-corrector iterative algorithms partially relaxed implicit strong monotonicity
暂未订购 下载PDF
Better Initial Placement Algorithm for Large-Scale Mixed-Mode Detailed Placement 认领 引用
11
作者 周强 罗丽娟 +1 位作者 洪先龙 周汉斌 《Journal of Semiconductors》 CAS 北大核心 2004年第7期784-789,共6页
An algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells IC design.Due to the limitation of computing complexity,an effective and efficient initial place... An algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells IC design.Due to the limitation of computing complexity,an effective and efficient initial placement is very important for detailed placement.Novelty of this algorithm lies in a better solution at initial stage by using network flow method to satisfy row capacity constraint and the thought of linear placement problem(LPP) to resolve overlaps.Moreover,divide and conquer strategy and other simplified methods are adopted to minimize complexity.Experimental results show that the algorithm can get an average of 16% wire length improvement on PAFLO in reasonable CPU time. 展开更多
关键词 placement detailed placement mixed mode placement algorithm
暂未订购 下载PDF
Greedy Algorithm in m-Term Approximation for Periodic Besov Class with Mixed Smoothness 认领 引用
12
作者 宋占杰 叶培新 《Transactions of Tianjin University》 EI CAS 2009年第1期75-78,共4页
Nonlinear m-term approximation plays an important role in machine learning, signal processing and statistical estimating. In this paper by means of a nondecreasing dominated function, a greedy adaptive compression num... Nonlinear m-term approximation plays an important role in machine learning, signal processing and statistical estimating. In this paper by means of a nondecreasing dominated function, a greedy adaptive compression numerical algorithm in the best m -term approximation with regard to tensor product wavelet-type basis is pro-posed. The algorithm provides the asymptotically optimal approximation for the class of periodic functions with mixed Besov smoothness in the L q norm. Moreover, it depends only on the expansion of function f by tensor pro-duct wavelet-type basis, but neither on q nor on any special features of f. 展开更多
关键词 greedy algorithm m -term approximation Besov space mixed smoothness
暂未订购 下载PDF
EXISTENCE AND ALGORITHM OF SOLUTIONS FOR GENERAL MULTIVALUED MIXED IMPLICIT QUASI-VARIATIONAL INEQUALITIES 认领 引用
13
作者 曾六川 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2003年第11期1324-1333,共10页
A new class of general multivalued mixed implicit quasi-variational inequalities in a real Hilbert space was introduced, which includes the known class of generalized mixed implicit quasi-variational inequalities as a... A new class of general multivalued mixed implicit quasi-variational inequalities in a real Hilbert space was introduced, which includes the known class of generalized mixed implicit quasi-variational inequalities as a special case , introduced and studied by Ding Xie-ping . The auxiliary variational principle technique was applied to solve this class of general multivalued mixed implicit quasi-variational inequalities. Firstly, a new auxiliary variational inequality with a proper convex , lower semicontinuous , binary functional was defined and a suitable functional was chosen so that its unique minimum point is equivalent to the solution of such an auxiliary variational inequality . Secondly , this auxiliary variational inequality was utilized to construct a new iterative algorithm for computing approximate solutions to general multivalued mixed implicit quasi-variational inequalities . Here , the equivalence guarantees that the algorithm can generate a sequence of approximate solutions. Finally, the existence of solutions and convergence of approximate solutions for general multivalued mixed implicit quasi-variational inequalities are proved. Moreover, the new convergerce criteria for the algorithm were provided. Therefore, the results give an affirmative answer to the open question raised by M. A . Noor, and extend and improve the earlier and recent results for various variational inequalities and complementarity problems including the corresponding results for mixed variational inequalities, mixed quasi-variational inequalities and quasi-complementarity problems involving the single-valued and set- valued mappings in the recent literature . 展开更多
关键词 general multivalued mixed implicit quasi-variational inequality auxiliary variational principle technique existence algorithm
暂未订购 下载PDF
ALGORITHM OF SOLUTIONS FOR MIXEDNONLINEAR VARIATIONAL-LIKE INEQUALITIES IN REFLEXIVE BANACH SPACE 认领 引用
14
作者 丁协平 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 1998年第6期521-529,共9页
In this paper, the author studies a class of mixed nonlinear variational-like inequalities in reflexive Banach space. By applying a minimax inequality obtained by the author, some existence uniqueness theorems of solu... In this paper, the author studies a class of mixed nonlinear variational-like inequalities in reflexive Banach space. By applying a minimax inequality obtained by the author, some existence uniqueness theorems of solutions for the mixed nonlinear variational-like inequalities are proved. Next, by applying the auxiliary problem technique, rite author suggests an innovative iterative algorithm to compute the approximate solutions of the mixed nonlinear variational-like inequalities. Finally, the convergence criteria is also discussed. 展开更多
关键词 mixed nonlinear variational-like inequality minimax inequality auxiliary variational inequality general algorithm reflexive Banach space
暂未订购 下载PDF
Dimension-down iterative algorithm for the mixed transportation network design problem 认领 引用
15
作者 陈群 姚加林 《Journal of Southeast University(English Edition)》 EI CAS 2012年第2期236-239,共4页
An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programmin... An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programming with equilibrium constraints （MPEC）. The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium （UE） model. The idea of the proposed DDIA is to reduce the dimensions of the problem. A group of variables （discrete/continuous） are fixed to altemately optimize another group of variables （continuous/discrete）. Some continuous network design problems （CNDPs） and discrete network design problems （DNDPs） are solved repeatedly until the optimal solution is obtained. A numerical example is given to demonstrate the efficiency of the proposed algorithm. 展开更多
关键词 mixed network design problem （MNDP） dimension-down iterative algorithm （DDIA） mathematical programming with equilibrium constraint （MPEC）
暂未订购 下载PDF
Existence and algorithm of solutions for a system of generalized mixed implicit equilibrium problems in Banach spaces 认领 引用
16
作者 丁协平 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2010年第9期1049-1062,共14页
A new system of generalized mixed implicit equilibrium problems is introduced and studied in Banach spaces. First, the notion of the Yosida proximal mapping for generalized mixed implicit equilibrium problems is intro... A new system of generalized mixed implicit equilibrium problems is introduced and studied in Banach spaces. First, the notion of the Yosida proximal mapping for generalized mixed implicit equilibrium problems is introduced. By using the notion, a system of generalized equation problems is considered, and its equivalence with the system of generalized mixed implicit equilibrium problems is also proved. Next, by applying the system of generalized equation problems, we suggest and analyze an iterative algorithm to compute the approximate solutions of the system of generalized mixed implicit equilibrium problems. The strong convergence of the iterative sequences generated by the algorithm is proved under quite mild conditions. The results are new and unify and generalize some recent results in this field. 展开更多
关键词 generalized mixed implicit equilibrium problem Yosida proximal mapping,generalized equation problem iterative algorithm Banach space
暂未订购 下载PDF
Iterative algorithm for solutions to new system of generalized mixed implicit equilibrium 认领 引用
17
作者 丁协平 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2013年第1期113-126,共14页
A new system of generalized mixed implicit equilibrium problems （SGMIEP） involving nonmonotone set-valued mappings is introduced and studied in real reflexive Banach spaces. First, an auxiliary mixed equilibrium pro... A new system of generalized mixed implicit equilibrium problems （SGMIEP） involving nonmonotone set-valued mappings is introduced and studied in real reflexive Banach spaces. First, an auxiliary mixed equilibrium problem （AMEP） is introduced. The existence and the uniqueness of the solutions to the AMEP are proved under quite mild assumptions without any coercive conditions. Next, by using the solution mapping of the AMEP, a system of generalized equation problems （SGEP） is considered, and its equivalence with the SGMIEP is shown. By using the SGEP, a new iterative algorithm for solving the SGMIEP is proposed and analyzed. The strong convergence of the iterative sequences generated by the algorithm is proved under suitable conditions. These results are new, which unify and generalize some recent results in this field. 展开更多
关键词 system of generalized mixed implicit equilibrium problems （SGMIEP）,auxiliary mixed equilibrium problem （AMEP） system of generalized equation problems（SGEP） iterative algorithm reflexive Banach space
暂未订购 下载PDF
Auxiliary principle and three-step iterative algorithms for generalized set-valued strongly nonlinear mixed variational-like inequalities 认领 引用 被引量：1
18
作者 徐海丽 郭兴明 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2007年第6期721-729,共9页
An auxiliary principle technique to study a class of generalized set-valued strongly nonlinear mixed variational-like inequalities is extended. The existence and uniqueness of the solution of the auxiliary problem for... An auxiliary principle technique to study a class of generalized set-valued strongly nonlinear mixed variational-like inequalities is extended. The existence and uniqueness of the solution of the auxiliary problem for the generalized set-valued strongly nonlinear mixed variational-like inequalities are proved, a novel and innovative three-step iterative algorithm to compute approximate solution is constructed, and the existence of the solution of the generalized set-valued strongly nonlinear mixed variational-like inequality is shown using the auxiliary principle iterative sequences generated by the algorithm technique. The convergence of three-step is also proved. 展开更多
关键词 mixed variational-like inequality three-step iterative algorithm set-valued mapping auxiliary principle technique
暂未订购 下载PDF
SOME NEW ITERATIVE ALGORITHMS FOR MONOTONE MIXED VARIATIONAL INEQUALITIES 认领 引用 被引量：4
19
作者 Zhang XianDept. of Basic Courses,Jimei Univ.,Xiamen 361021. 《Applied Mathematics(A Journal of Chinese Universities)》 2002年第1期80-84,共5页
In this paper,some new iterative algorithms for monotone mixed variational inequalities and the convergence in real Hilbert spaces are studied.
关键词 mixed variational inequality iterative algorithm monotone operator. Supported by Natural Science Foundation of Education Council of Fujian Province of China.
暂未订购 下载PDF
Optimization of Truss Structures Using Nature-Inspired Algorithms with Frequency and Stress Constraints 认领 引用 被引量：1
20
作者 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
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈