汽车供应物流循环取货车辆路径问题研究.docxVIP

编码和初始群体生成函数function seeds=Get_Seeds(n,m,seed_count)seeds=zeros(seed_court,m+n+1);for count=1:seed_count rp=randperm(n); insert_position=randperm(n-1); ip=[0 sort(insert_position(1:m)) n]; target=zeros(1,m+n); for i=1:m+1 target(ip(i)+i:ip(i+1)+i-1)=rp((ip(i)+1):ip(i+1)); end seeds(count,:)=[0 target];endend重要函数实现function z=Get_Z(d,x,s,ET,LT,qy,Q)if prod(double(s=ET))*prod(double(s=LT))*prod(double(q*y=Q))sizex=size(x); temp=zeros(sizex); for k=1:sizex(3) temp(:,:,k)=x(:,:,k).*d; end z=sum(temp(:);else zendend适应度函数%fitness function%function f_group=Get_F(d,x_g,s_g,ET,LT,q,y_g,Q)%x_g means group’s s, in fact, it holds all the s of the members of group%sizeg=size(s_g);%f_group=zeros(sizeg(1));%for i=1:sizeg(1)% f_group(i)=Get_Z(d,x_g(i),s_g(i,:),ET,LT,q,y_g(i),Q);%end%min_z=min(f_group);%for i=1:sizeg(1)% f_group(i)=min_z/f_group(i);%end%end选择操作function newgroup=selectionroulette(group,f_group,n_newgroup)size_g=size(group);newgroup=zeros(n_newgroup,size_g(2));p=f_group/sum(f_group);for i=2:length(p)p(i)=p(i-1)+P(i);endfor i=1:n_newgrouppin=rand;newgroup(I,:)=group(find(1==(pinp),1),:);endend交叉操作function [newA,newB]=cross_over(A,B)[non_zero_A,zero_position_A]un_zeros(A);%去零[non_zero_B,zero_position_B]=un_zeros(B);insert_position=randperm(length(non_zero_A)-1);%随机选择映射段ip=sort(inset_position(1:2));temp_A=non_zero_A;temp_B=non_zero_B;temp_A(ip(1)+1:ip(2))=non_zero_B(ip(1)+1:ip(2));%交换映射段基因temp_B(ip(1)+1:ip(2))=non_zero_A(ip(1)+1:ip(2));lack_A=setdiff(1:length(non_zero_A),temp_A);%确定映射关系lack_B=setdiff(1:length(non_zero_A),temp_B);for i=1:length(lack_B);%将后代合法化 positions=find(temp_A==lack_B(i)); pointer=sum(~ismember(positions,ip(1)+1:ip(2).*positions); temp_A(pointer)=lack_A(i);endfor i=1:length(lack_A); positions=find(temp_B==lack_A(i)); pointer=sum(~ismember(positions,ip(1)+1:ip(2)).*positions); temp_B(pointer)=lack_B(i);endnewA=put_zeros_back(temp_A,zero_position_A);%恢复插入零newB=put_zeros_back(temp_B,zero_position_B); function