【智能优化算法-正弦余弦算法】基于正弦余弦算法求解高维优化问题附matlab代码

最新推荐文章于 2024-11-09 21:51:15 发布

matlab科研助手

最新推荐文章于 2024-11-09 21:51:15 发布

阅读量242

点赞数

分类专栏：优化求解文章标签：算法 matlab 开发语言

本文链接：https://blog.csdn.net/matlab_dingdang/article/details/126107608

版权

优化求解专栏收录该内容

552 篇文章 71 订阅

订阅专栏

该博客介绍了正弦余弦算法（SCA）的基础原理及其在解决优化问题中的应用。通过Matlab代码示例，展示了如何设置参数并运行SCA算法来寻找测试函数的最佳解。仿真结果包括搜索空间和目标函数收敛曲线的可视化展示，以及最佳解和最优目标函数值的输出。

摘要由CSDN通过智能技术生成

1 内容介绍

ＳＣＡ算法是基于正弦余弦数学模型进而提出的一种新型优化算法．一般来说，智能优化算法的初始点往往随机选取一系列个体，虽然无法保证在一次迭代过程中就能找到最优解，但如果有足够的个体和迭代次数，并利用目标函数进行反复评价，ＳＣＡ算法可大大增加获得最优解的概率．

2 仿真代码

% Sine Cosine Algorithm (SCA)
%
% Main paper:
% S. Mirjalili, SCA: A Sine Cosine Algorithm for solving optimization problems
% Knowledge-Based Systems, DOI: http://dx.doi.org/10.1016/j.knosys.2015.12.022
%_______________________________________________________________________________________________
% You can simply define your cost function in a seperate file and load its handle to fobj
% The initial parameters that you need are:
%__________________________________________
% fobj = @YourCostFunction
% dim = number of your variables
% Max_iteration = maximum number of iterations
% SearchAgents_no = number of search agents
% lb=[lb1,lb2,...,lbn] where lbn is the lower bound of variable n
% ub=[ub1,ub2,...,ubn] where ubn is the upper bound of variable n
% If all the variables have equal lower bound you can just
% define lb and ub as two single numbers

% To run SCA: [Best_score,Best_pos,cg_curve]=SCA(SearchAgents_no,Max_iteration,lb,ub,dim,fobj)
%______________________________________________________________________________________________

clear all
clc

SearchAgents_no=30; % Number of search agents

Function_name='F1'; % Name of the test function that can be from F1 to F23 (Table 1,2,3 in the paper)

Max_iteration=1000; % Maximum numbef of iterations

% Load details of the selected benchmark function
[lb,ub,dim,fobj]=Get_Functions_details(Function_name);

[Best_score,Best_pos,cg_curve]=SCA(SearchAgents_no,Max_iteration,lb,ub,dim,fobj);

figure('Position',[284 214 660 290])
%Draw search space
subplot(1,2,1);
func_plot(Function_name);
title('Test function')
xlabel('x_1');
ylabel('x_2');
zlabel([Function_name,'( x_1 , x_2 )'])
grid off

%Draw objective space
subplot(1,2,2);
semilogy(cg_curve,'Color','b')
title('Convergence curve')
xlabel('Iteration');
ylabel('Best flame (score) obtained so far');

axis tight
grid off
box on
legend('SCA')

display(['The best solution obtained by SCA is : ', num2str(Best_pos)]);
display(['The best optimal value of the objective funciton found by SCA is : ', num2str(Best_score)]);