xunh1.m

经典的排队论程序

function  [J2]=xunh1(x,av1,ad3,bv,bd,c1,c2,c3,d1,d2,d3,c,s)
% sutiful for the numberof living channels   less than 
%av1=0.07;%:0.005:0.03;
%avv=av1;
%avv1=av1;
%avv2=av1;
av2=0.25*av1;
av3=0.1*av1;
ad2=0.25*ad3;
ad1=0.1*ad3;
avv=av1+av2+av3;
avv1=av2+av3;
avv2=av3;
add=ad1+ad2+ad3;
add1=ad2+ad3;
add2=ad3;
%add=ad1;
%add1=add;
%add2=add;
    A2=zeros(s+1,(x-1)*(s+1)); 
    I2=zeros(s+1,(c3-1-x)*(s+1));
   for i=1:s+1
     B2(i,1)=-avv;
   end
     B2=spdiags([B2],[0],s+1,s+1);
   for i=1:s
if  i>=1&i<=d1;  
    C2(i,1)=-add;
elseif i>=d1+1&i<=d2; 
    C2(i,1)=-add1;
elseif  i>=d2+1&i<=d3; 
    C2(i,1)=-add2;    
end 
end
C2=[C2;0];
 for i=1:s
if  i>=1&i<=d1;  
    D2(i,1)=add+avv+x*bv+min(c-x,i-1)*bd;
elseif i>=d1+1&i<=d2; 
    D2(i,1)=add1+avv+x*bv+min(c-x,i-1)*bd;
elseif i>=d2+1&i<=d3; 
   D2(i,1)=add2+avv+x*bv+min(c-x,i-1)*bd;    
end 
end
 D2(s+1,1)=avv+x*bv+min(c-x,s)*bd;  
  for i=1:s
     E2(i,1)=-min(c-x,i)*bd;
  end
  E2=[0;E2];
  F2=spdiags([C2,D2,E2],[-1,0,1],s+1,s+1);
 for i=1:s+1
     H2(i,1)=-(x+1)*bv;
  end
  H2=spdiags([H2],[0],s+1,s+1);
  J2=[A2,B2,F2,H2,I2];