检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:GAO Yaqiong WU Jin SU Zhengdong LI Chaoxing 高亚琼(School of Electronic Engineering,Xi'an University of Posts and Telecommunications,Xi'an 710121,P.R.China)
出 处:《High Technology Letters》2024年第4期405-414,共10页高技术通讯(英文版)
基 金:Supported by the National Key R&D Program of China(2022ZD0119001).
摘 要:In this paper,a multi-strategy improved coati optimization algorithm(MICOA)for engineering applications is proposed to improve the performance of the coati optimization algorithm(COA)in terms of convergence speed and convergence accuracy.First,a chaotic mapping is applied to initial-ize the population in order to improve the quality of the population and thus the convergence speed of the algorithm.Second,the prey’s position is improved during the prey-hunting phase.Then,the COA is combined with the particle swarm optimization(PSO)and the golden sine algorithm(Gold-SA),and the position is updated with probabilities to avoid local extremes.Finally,a population decreasing strategy is applied as a way to improve the performance of the algorithm in a comprehen-sive approach.The paper compares the proposed algorithm MICOA with 7 well-known meta-heuristic optimization algorithms and evaluates the algorithm in 23 test functions as well as engineering appli-cation.Experimental results show that the MICOA proposed in this paper has good effectiveness and superiority,and has a strong competitiveness compared with the comparison algorithms.
关 键 词:coati optimization algorithm(COA) chaotic map multi-strategy
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程] O224[自动化与计算机技术—控制科学与工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.15.10.196