what is the function that the same as perms however can used n more than 10?

Question

sharifah shuthairah syed abdullah 2018-7-3

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/408482-what-is-the-function-that-the-same-as-perms-however-can-used-n-more-than-10

评论： sharifah shuthairah syed abdullah 2018-7-4

when i build a coding i used n less than 10, i used perms function.. then when get the correct coding the i test the coding in various size of n, which is n more than 10, however the length for perm is less than 10. what is the same function as perm, but can used for n more than 10?

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

OCDER 2018-7-3

1
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/408482-what-is-the-function-that-the-same-as-perms-however-can-used-n-more-than-10#answer_327222

在 MATLAB Online 中打开

I think you need to make your own function of perms, but one that only returns 1 of many permutations at a time. When you past n = 10, you'll run out of memory fast.

        3.5 GB   n = 11
       46.0 GB   n = 12
      647.6 GB   n = 13
     9764.0 GB   n = 14

One suggestion is to make a classdef object that track the ith permutation and will continuously return the the next permutation. But read this link as your attempt to compute permutations for n >> 11 gets fairly impossible...

https://www.mathworks.com/matlabcentral/answers/312609-how-to-get-all-permutation-of-a-large-vector

12 个评论
显示 10更早的评论隐藏 10更早的评论

sharifah shuthairah syed abdullah 2018-7-3

在 MATLAB Online 中打开

its possible to solve the problem using matlab right? this is the coding..

     f=[  0  1  2  2  3  4  4  5  3  5  6  7  8  9  7  8;
     1  0  1  1  2  3  3  4  2  4  5  6  7  8  6  7;
     2  1  0  2  1  2  2  3  1  3  4  5  6  7  5  6;
     2  1  2  0  1  2  2  3  3  3  4  5  6  7  5  6;
     3  2  1  1  0  1  1  2  2  2  3  4  5  6  4  5;
     4  3  2  2  1  0  2  3  3  1  2  3  4  5  3  4;
     4  3  2  2  1  2  0  1  3  1  2  3  4  5  3  4;
     5  4  3  3  2  3  1  0  4  2  1  2  3  4  2  3;
     3  2  1  3  2  3  3  4  0  4  5  6  7  8  6  7;
     5  4  3  3  2  1  1  2  4  0  1  2  3  4  2  3;
     6  5  4  4  3  2  2  1  5  1  0  1  2  3  1  2;
     7  6  5  5  4  3  3  2  6  2  1  0  1  2  2  3;
     8  7  6  6  5  4  4  3  7  3  2  1  0  1  1  2;
     9  8  7  7  6  5  5  4  8  4  3  2  1  0  2  1;
     7  6  5  5  4  3  3  2  6  2  1  2  1  2  0  1;
     8  7  6  6  5  4  4  3  7  3  2  3  2  1  1  0 ];
     d=[
     0  3  4  6  8  5  6  6  5  1  4  6  1  5  4  5;
     3  0  6  3  7  9  9  2  2  7  4  7  9  6  3  2;
     4  6  0  2  6  4  4  4  2  6  3  6  5  6  2  6;
     6  3  2  0  5  5  3  3  9  4  3  6  3  4  7  8;
     8  7  6  5  0  4  3  4  5  7  6  7  7  3  3  3;
     5  9  4  5  4  0  8  5  5  5  7  5  1  8  5  4;
     6  9  4  3  3  8  0  6  8  4  6  7  1  8  5  6;
     6  2  4  3  4  5  6  0  1  5  5  3  7  5  9  4;
     5  2  2  9  5  5  8  1  0  4  5  2  4  5  4  5;
     1  7  6  4  7  5  4  5  4  0  7  7  5  6  5  5;
     4  4  3  3  6  7  6  5  5  7  0  9  6  5  1  8;
     6  7  6  6  7  5  7  3  2  7  9  0  6  5  4  5;
     1  9  5  3  7  1  1  7  4  5  6  6  0  5  7  4;
     5  6  6  4  3  8  8  5  5  6  5  5  5  0  5  3;
     4  3  2  7  3  5  5  9  4  5  1  4  7  5  0  8;
     5  2  6  8  3  4  6  4  5  5  8  5  4  3  8  0];
     [r,c]=size(f); 
      max_i= r;
      max_j =r;
      max_k= r;
      max_n= r;
      A=zeros(r,r);m=0;
      ID=perms([1:r]);
      x=zeros(r,r); 
      n=length(ID);
      for i=1:n
        for j=1:r
        x1=ID(i,:);
        x(j,x1(j))=1;
        B(i).mat=x;  %store permutationof binary value, 0,1
        end
       x=zeros(r,r);  
      end
     for no=1:length(B)
        m=0;z=0;xa=B(no).mat;
     for i=1:max_i
        for j=1:max_j
          for k=1:max_k
            for n=1:max_n
                 z= z+ f(i,k).*d(j,n).*xa(i,j).*xa(k,n);
%                 m=m+1;
%                F(m)=z;
            end
           % end
        end
    end
end
no;
F(no,:)=[no z];
end
zmin=min(F(:,2));
ii=find(F(:,2)==zmin); 
% xbin = facility location for minimun z 
xbin= B(ii).mat
z_minimum = zmin

Walter Roberson 2018-7-3

https://www.mathworks.com/matlabcentral/fileexchange/53110-quadratic-assignment-problem--qap--using-ga--pso-and-fa

https://github.com/cshen/quadratic-assignment-problem

sharifah shuthairah syed abdullah 2018-7-4

i know this is an NP hard problem i have been doing this amlost 4 years now..i used randperm but it didnt satisfied my need....i also will also consider making MEX/C++ files after this...this stage is about finding optimal solution using branch n bound..i know need a lot of time for that...later i will use GA.. thank you everyone for answering my question..thank you so much

请先登录，再进行评论。