遗传算法matlab源码程序 - matlab算法设计

下载频道> 资源分类> matlab源码> 算法设计> 遗传算法matlab源码程序

标题：遗传算法matlab源码程序
分享到：

所属分类: 算法设计资源类型：程序源码文件大小: 2.42 MB 上传时间: 2019-06-17 22:54:09 下载次数: 35 资源积分：1分提供者: zhangsan456 code

内容：
遗传算法matlab源码程序

function feasibleKids=feasible(newKids,fixcost,demand,covermatrix,beta)

% input parameters: newKids,FitnessFcn,fixcost,demand,covermatrix,beta

kids=newKids;

[n,m]=size(covermatrix);%find the size of demand and service

TotalDemand=sum(demand);%total demand

%----------------------------------------------------------

% analysis if kids is feasible

covermat=zeros(n,m);%covered matrix under present solution

bbi=zeros(n,1);%initiate a vector

for i=1:n

for j=1:m

covermat(i,j)=covermatrix(i,j)*kids(j);

end

covered=zeros(n,1);%covered demand points

bbi=sum(covermat,2);

for i=1:n

if bbi(i)>=1

covered(i)=1;

else

covered(i)=0;

end

CovD=demand*covered;%total demand has been covered

if CovD>beta*TotalDemand

feasibleKids=kids;

else

feasibleKids = ffeasible(newKids,fixcost,demand,covermatrix,beta,bbi,covered);

end

%=====================================================================

function fKids = ffeasible(newKids,fixcost,demand,covermatrix,beta,bbi,covered)

%subfunction to add new facility locations and do some adjustment

kids=newKids;

[n,m]=size(covermatrix);%find the size of demand and service

faij=zeros(n,1);%demand set that covered by facility j in column vector

TotalDemand=sum(demand);%total demand

ksi=zeros(n,1);%the number of facilities that cover a demand node

uncover=ones(n,1);%initialize the uncovered set of demand node

rj=zeros(1,m);%the weighted uncovered facility set

%------------------------------------------------------

ksi=bbi;

uncover=~covered;

CovD=demand*covered;%total demand has been covered

while CovD<beta*TotalDemand

if sum(kids)==m

fKids=kids;

return;

end

unlocate=~kids;%unlocated facility cites set

for j=1:m

if unlocate(j)==1

rj(j)=(uncover.*demand')'*covermatrix(:,j)/fixcost(j);

else

rj(j)=0;

end

[mind,rjD]=max(rj);

kids(rjD)=1;

faij=covermatrix(:,rjD);%demand set covered by facility rjD

for i=1:n %calculate the number of facilities cover each demand node

if faij(i)==1

ksi(i)=ksi(i)+1;

if ksi(i)>=1

uncover(i)=0;

end

CovD=demand*~uncover;%total demand has been covered

end

%%----------------------------------------------------------

%% delete redundant facility

for j=1:m

if kids(j)==1

faij=covermatrix(:,j);%demand set covered by facility j in column vector

nksi=0;%the number of ksi who greater than 2 in set faij

for i=1:n

if faij(i)==1

if ksi(i)>=2

nksi=nksi+1;

end

if nksi==sum(faij)

kids(j)=0;%delet the jth facility from solution

for i=1:n

if faij(i)==1

ksi(i)=ksi(i)-1;

end

% ---------------------------------------------------------

% output solution

fKids=kids;

% =====================================================================

% end of main feasible function

文件列表（点击上边下载按钮，如果是垃圾文件请在下面评价差评或者投诉）:

关键词：遗传算法

matlab源码下载排行

回到顶部

友情链接

matlab源码网站源码编程语言网络编程手机通讯编程 KUNAG 官网 KUNAG 电商更多

: 联系方式| 版权声明| 招聘信息| 广告服务| 银行汇款| 法律顾问| 兼职技术| 付款方式| 关于我们|; 网站客服程序员兼职招聘 411241577@qq.com; 沪ICP备19040327号-3; 公安备案号：沪公网安备 31011802003874号; 库纳格流体控制系统（上海）有限公司版权所有; Copyright © 1999-2014, GUSUCODE.COM, All Rights Reserved

关键词： 遗传算法

相关推荐

matlab源码下载排行

友情链接

关键词：遗传算法