蚁狮算法如何应用于matlab实现经济调度优化问题？

本文共计636个文字，预计阅读时间需要3分钟。

1. 简介

2.编辑

3.编辑

4.编辑

5.编辑

6.编辑

7.编辑

8.编辑

9.编辑

10.编辑

11.部分

12.代码

25_________________________________________________________________________25

clc; clear; close all; warning off; % 根据您的问题修改以下细节

1 简介

​

编辑

​

编辑

​

编辑

​

编辑

​

编辑

​

编辑

2 部分代码

%_________________________________________________________________________%clc;clear;closeall;warningoff;%Changethesedetailswithrespecttoyourproblem%%%%%%%%%%%%%%%ThisprogramsolvestheeconomicdispatchwithBmncoefficientsbyMOALO%Algorithm%Thedatamatrixshouldhave5columnsoffuelcostcoefficientsandplantlimits.%1.a($/MW^2)2.b$/MW3.c($)4.lowerlomit(MW)5.Upperlimit(MW)%noofrowsdenotethenoofplants(n)data=[0.00772401005000.009510200502000.0098.5220803000.00911200501500.00810.5220502000.00751212050120];%LosscoefficientsitshouldbesquarematrixofsizenXnwherenistheno%ofplantsB=1e-4*[0.140.170.150.190.260.220.170.60.130.160.150.20.150.130.650.170.240.190.190.160.170.710.30.250.260.150.240.30.690.320.220.20.190.250.320.85];%Demand(MW)Pd=700;ObjectiveFunction=@eldnba;dim=length(data(:,1));;lb=0;ub=1;obj_no=1;ifsize(ub,2)==1ub=ones(1,dim)*ub;lb=ones(1,dim)*lb;end%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%InitialparametersoftheMODAalgorithmmax_iter=100;N=100;ArchiveMaxSize=100;Archive_X=zeros(100,dim);Archive_F=ones(100,obj_no)*inf;Archive_member_no=0;r=(ub-lb)/2;V_max=(ub(1)-lb(1))/10;Elite_fitness=inf*ones(1,obj_no);Elite_position=zeros(dim,1);Ant_Position=initialization(N,dim,ub,lb);fitness=zeros(N,2);V=initialization(N,dim,ub,lb);iter=0;position_history=zeros(N,max_iter,dim);foriter=1:max_iterfori=1:N%CalculatealltheobjectivevaluesfirstParticles_F(i,:)=ObjectiveFunction(Ant_Position(:,i)');ifdominates(Particles_F(i,:),Elite_fitness)Elite_fitness=Particles_F(i,:);Elite_position=Ant_Position(:,i);endend[Archive_X,Archive_F,Archive_member_no]=UpdateArchive(Archive_X,Archive_F,Ant_Position,Particles_F,Archive_member_no);ifArchive_member_no>ArchiveMaxSizeArchive_mem_ranks=RankingProcess(Archive_F,ArchiveMaxSize,obj_no);[Archive_X,Archive_F,Archive_mem_ranks,Archive_member_no]=HandleFullArchive(Archive_X,Archive_F,Archive_member_no,Archive_mem_ranks,ArchiveMaxSize);elseArchive_mem_ranks=RankingProcess(Archive_F,ArchiveMaxSize,obj_no);endArchive_mem_ranks=RankingProcess(Archive_F,ArchiveMaxSize,obj_no);%Chosethearchivememberintheleastpopulationareaasarrtactor%toimprovecoverageindex=RouletteWheelSelection(1./(Archive_mem_ranks+1e-20));ifindex==-1index=1;endElite_fitness=Archive_F(index,:);Elite_position=Archive_X(index,:)';Random_antlion_fitness=Archive_F(1,:);Random_antlion_position=Archive_X(1,:)';fori=1:Nindex=0;neighbours_no=0;RA=Random_walk_around_antlion(dim,max_iter,lb,ub,Random_antlion_position',iter);[RE]=Random_walk_around_antlion(dim,max_iter,lb,ub,Elite_position',iter);Ant_Position(:,i)=(RE(iter,:)'+RA(iter,:)')/2;Flag4ub=Ant_Position(:,i)>ub';Flag4lb=Ant_Position(:,i)<lb';Ant_Position(:,i)=(Ant_Position(:,i).*(~(Flag4ub+Flag4lb)))+ub'.*Flag4ub+lb'.*Flag4lb;enddisplay(['Attheiteration',num2str(iter),'thereare',num2str(Archive_member_no),'non-dominatedsolutionsinthearchive']);K(iter)=Elite_fitness;end[FPPl]=eldnba(Elite_position)plot(K)gridtitle('IterationvsBestFunctionValue');xlabel('Iteration')ylabel('FunctionValue')

3 仿真结果

​

编辑

4 参考文献

[1]彭暄惠, 陈才学, 熊志刚,等. 一种基于改进蚁狮算法的含电动汽车参与的微电网优化调度方法:.

博主简介：擅长智能优化算法、神经网络预测、信号处理、元胞自动机、图像处理、路径规划、无人机等多种领域的Matlab仿真，相关matlab代码问题可私信交流。

部分理论引用网络文献，若有侵权联系博主删除。

5 代码下载

​

编辑