高温环境下合金600在压力和输送介质的耦合作用下易发生应力腐蚀开裂,是合金管道的潜在失效模式,在多种影响因素共同作用下,一般参数化模型存在预测精度不高、泛化能力较差的问题,影响合金管道安全评估的准确性。将Faure序列初始种群、...高温环境下合金600在压力和输送介质的耦合作用下易发生应力腐蚀开裂,是合金管道的潜在失效模式,在多种影响因素共同作用下,一般参数化模型存在预测精度不高、泛化能力较差的问题,影响合金管道安全评估的准确性。将Faure序列初始种群、自适应引力全局搜索、精英保留策略局部搜索引入烟花算法,使用改进烟花算法(Improved Fire War Algorithm,IFWA)对结合Lasso回归和随机森林组成的回归增强随机森林算法(Regression-Enhanced Random Forest,RERF)超参数基学习器数量(n_estimate)、树的最大深度(max_depth)寻优,以RMSE为目标值使RERF达到全局搜索和局部搜索最优,形成基于IFWA-RERF的合金600应力腐蚀裂纹扩展速率预测模型,引入MAE和R2作为模型性能评价指标,建立数据集与测试集进行对比。结果表明:使用基于IFWA-RERF的合金600应力腐蚀裂纹扩展速率预测结果最接近实际数据,预测精度和稳定性均优于其他对比模型,有助于建立准确的安全评估模型。展开更多
For acquiring high energy efficiency and the maximal throughput, a new time slot structure is designed for energy harvesting(EH) cognitive radio(CR). Considering the CR system with EH and cooperative relay, a best coo...For acquiring high energy efficiency and the maximal throughput, a new time slot structure is designed for energy harvesting(EH) cognitive radio(CR). Considering the CR system with EH and cooperative relay, a best cooperative mechanism(BCM)is proposed for CR with EH. To get the optimal estimation performance, a quantum fireworks algorithm(QFA) is designed to resolve the difficulties of maximal throughput and EH, and the proposed cooperative mechanism is called as QFA-BCM. The proposed QFA combines the advantages of quantum computation theory with the fireworks algorithm(FA). Thus the QFA is able to obtain the optimal solution and its convergence performance is proved. By using the new cooperation mechanism and computing algorithm, the proposed QFA-BCM method can achieve comparable maximal throughput in the new timeslot structure. Simulation results have proved that the QFA-BCM method is superior to previous non-cooperative and cooperative mechanisms.展开更多
Recently,multimodal multiobjective optimization problems(MMOPs)have received increasing attention.Their goal is to find a Pareto front and as many equivalent Pareto optimal solutions as possible.Although some evolutio...Recently,multimodal multiobjective optimization problems(MMOPs)have received increasing attention.Their goal is to find a Pareto front and as many equivalent Pareto optimal solutions as possible.Although some evolutionary algorithms for them have been proposed,they mainly focus on the convergence rate in the decision space while ignoring solutions diversity.In this paper,we propose a new multiobjective fireworks algorithm for them,which is able to balance exploitation and exploration in the decision space.We first extend a latest single-objective fireworks algorithm to handle MMOPs.Then we make improvements by incorporating an adaptive strategy and special archive guidance into it,where special archives are established for each firework,and two strategies(i.e.,explosion and random strategies)are adaptively selected to update the positions of sparks generated by fireworks with the guidance of special archives.Finally,we compare the proposed algorithm with eight state-of-the-art multimodal multiobjective algorithms on all 22 MMOPs from CEC2019 and several imbalanced distance minimization problems.Experimental results show that the proposed algorithm is superior to compared algorithms in solving them.Also,its runtime is less than its peers'.展开更多
文摘高温环境下合金600在压力和输送介质的耦合作用下易发生应力腐蚀开裂,是合金管道的潜在失效模式,在多种影响因素共同作用下,一般参数化模型存在预测精度不高、泛化能力较差的问题,影响合金管道安全评估的准确性。将Faure序列初始种群、自适应引力全局搜索、精英保留策略局部搜索引入烟花算法,使用改进烟花算法(Improved Fire War Algorithm,IFWA)对结合Lasso回归和随机森林组成的回归增强随机森林算法(Regression-Enhanced Random Forest,RERF)超参数基学习器数量(n_estimate)、树的最大深度(max_depth)寻优,以RMSE为目标值使RERF达到全局搜索和局部搜索最优,形成基于IFWA-RERF的合金600应力腐蚀裂纹扩展速率预测模型,引入MAE和R2作为模型性能评价指标,建立数据集与测试集进行对比。结果表明:使用基于IFWA-RERF的合金600应力腐蚀裂纹扩展速率预测结果最接近实际数据,预测精度和稳定性均优于其他对比模型,有助于建立准确的安全评估模型。
基金supported by the National Natural Science Foundation of China(61571149)the Special China Postdoctoral Science Foundation(2015T80325)+2 种基金the Heilongjiang Postdoctoral Fund(LBH-Z13054)the China Scholarship Council and the Fundamental Research Funds for the Central Universities(HEUCFP201772HEUCF160808)
文摘For acquiring high energy efficiency and the maximal throughput, a new time slot structure is designed for energy harvesting(EH) cognitive radio(CR). Considering the CR system with EH and cooperative relay, a best cooperative mechanism(BCM)is proposed for CR with EH. To get the optimal estimation performance, a quantum fireworks algorithm(QFA) is designed to resolve the difficulties of maximal throughput and EH, and the proposed cooperative mechanism is called as QFA-BCM. The proposed QFA combines the advantages of quantum computation theory with the fireworks algorithm(FA). Thus the QFA is able to obtain the optimal solution and its convergence performance is proved. By using the new cooperation mechanism and computing algorithm, the proposed QFA-BCM method can achieve comparable maximal throughput in the new timeslot structure. Simulation results have proved that the QFA-BCM method is superior to previous non-cooperative and cooperative mechanisms.
基金supported in part by the National Natural Science Foundation of China(62071230,62061146002)the Natural Science Foundation of Jiangsu Province(BK20211567)the Deanship of Scientific Research(DSR)at King Abdulaziz University(KAU),Jeddah,Saudi Arabia(FP-147-43)。
文摘Recently,multimodal multiobjective optimization problems(MMOPs)have received increasing attention.Their goal is to find a Pareto front and as many equivalent Pareto optimal solutions as possible.Although some evolutionary algorithms for them have been proposed,they mainly focus on the convergence rate in the decision space while ignoring solutions diversity.In this paper,we propose a new multiobjective fireworks algorithm for them,which is able to balance exploitation and exploration in the decision space.We first extend a latest single-objective fireworks algorithm to handle MMOPs.Then we make improvements by incorporating an adaptive strategy and special archive guidance into it,where special archives are established for each firework,and two strategies(i.e.,explosion and random strategies)are adaptively selected to update the positions of sparks generated by fireworks with the guidance of special archives.Finally,we compare the proposed algorithm with eight state-of-the-art multimodal multiobjective algorithms on all 22 MMOPs from CEC2019 and several imbalanced distance minimization problems.Experimental results show that the proposed algorithm is superior to compared algorithms in solving them.Also,its runtime is less than its peers'.
