A Novel Modified Tree-Seed Algorithm for High-Dimensional Optimization Problems

来源 :电子学报(英文) | 被引量 : 0次 | 上传用户:huaduo4851
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
To efficiently handle high-dimensional continuous optimization problems,a Modified tree-seed algorithm(MTSA) is proposed by coupling a newly introduced control parameter named as Seed domain shrinkable coefficient(SDSC) and Local reinforcement strategy(LRS) based on gradient information of adjacent-generation best trees.SDSC is dynamically decreased with iterations to adjust the produced domain of offspring seeds,for achieving the tradeoff between the global exploration and local exploitation.LRS strategy is to execute local exploitation process by employing gradient information of two best trees,for enhancing convergence efficiency and local optima avoidance with probabilities.The compared experimental results show the different effects of different-type SDSC on MTSA,the faster convergence efficiency and the stronger robustness of the proposed MTSA.
其他文献
Diagnosability is an important property in the field of fault diagnosis.In this paper,a novel approach based on logical formula is proposed to verify diagnosabi
We illustrate the principle of Digital satellite TV differential timing (DSTVDT) and propose an optimal weighting method that reduces the timing error introduce
期刊
期刊
期刊
A hybrid Analog to digital converter (ADC) is presented for long-wave infrared focal plane arrays.A two-stage quantization structure is applied in the folding i
We propose a novel Fast dimensionreduc-ing ranked query method (FDRQM) with high security for encrypted cloud data.We use Principal component analysis (PCA) alg
Text similarity measurements are the basis for measuring the degree of matching between two or more texts.Traditional large-scale similarity detection methods b
期刊
期刊