Location and Layout of Common Storage and Multichannel Common Distribution considering Time Windows

Algorithm 1

 for i=1:length (Ware House) no_WH=Ware House(i);

  no_WH_N=find (WH_N==i); [~,temp_p]=sort (x(no_WH_N,3));

  no_WH_N=no_WH_N (temp_p); num_V=data.WareHouse (no_WH,4);

  recording.V{i}=zeros (num_V,10); S_WH=data.WareHouse (no_WH,2);

  for j=1:length (no_WH_N).

   if no_WH_N(j)<=data.num_WH continue;

   end no_N=no_WH_N(j);

   Type_Cargoes=data.Demand (no_N,5); weight_Cargoes=.

   (data.Demand(no_N,2 : 3)); [~,priority_V]=sor t(x(no_N,4 : 3+num_V));