update 20May2016

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%% One-dimensional bin packing problem %%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%% Project II | 20 May 2016%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%% WANCHAI SUKSRINUAN & AMNUY kUYBAN %%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

clc;
clear;
disp('................................................');
disp('One dimensional bin-packing heuristic algorithms');
disp('Select Input Type');
%disp('Press 1 - Auto Input;');
%disp('Press 1 - Manual Input;');


%chosen=input('Enter your choice : ');
% if chosen==1,
% %u = [5 3 4 9 1 8 7 8 11 5];
% %u = [4 11 8 5 2 8 7 2 2 11];
% r_keyboard = input('Number of object : ');
% number_object = r_keyboard;
% u = round(rand(1,number_object)*10)+1;
% %round(rand(1)*100);
%     for i=1:number_object,
%
%         fprintf('object %d', i);
%         fprintf(' = %d\n', u(i));
%     end
%     %sort(u)
% input_input = u
% b = sort(u, 'descend');
% u = b
%
% end


r_keyboard = input('Number of object : ');
%u = [5 3 4 9 1 8 7 8 11 5];
number_object = r_keyboard;
start = 1;
    for i=1:number_object,
        fprintf('object %d', i);
        u(i) = input(' Insert your object value : ');
        fprintf('object %d', i);
        fprintf(' = %d\n', u(i));

        fprintf('copy object %d', i);
        copy(i) = input(' Insert your copy object value : ');
        fprintf('copy %d', i);
        fprintf(' = %d\n', copy(i));

        for j=start:(start+copy(i)-1),
            input_all(j) = u(i);
        end
        start = start+copy(i);

    input_all
   % input_input = u
    u = input_all; %input
    b = sort(u, 'descend');
    u = b


end

%u = [1 4 2 1 2 3 5 5 6 3 2 4];
n = length(u);

%fprintf('BIN = %d', i);
C = input(' Insert your BIN value : ');
%fprintf('bin size = %d\n', C);
disp('................................................');
r = C*ones(1,n);
w = zeros(n);

[ud1,idec]=sort(-u); % sort obj.
ud=-ud1;
[tmp,irec]=sort(idec);

disp('................................................');
disp('One dimensional bin-packing heuristic algorithms');
disp('Press 0 - default choice;');
disp('Press 1 - FFD method;');
%disp('Press 2 - first fit decreasing method;');
disp('Press 2 - BFD method;');
%disp('Press 4 - best fit decreasing method;');
chosen=input('Enter your choice : ');




% ****************************  FFD method  ****************************** %
if chosen==0 | chosen==1,  % first fit method
wff=w; rff=r+0.01; % initialize for first fit method
for i=1:n,
   idx=min(find([u(i)*ones(1,n)<=rff]));
   wff(i,idx)=1;
   rff(idx)=rff(idx)-u(i);  % update the state
end
disp('% *******************************');
disp('the assignment are:')
disp(wff)

% B = wff(:,1)
% A = input_input'
% B = logical(B);
% A(B)

N_feature = size(wff,2);

input_temp = [u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u'];
% Q = [input_temp(:,1:4)]
% C = wff(:,1:4);
% C = logical(C);
% Q(C)
%show_out = input_temp(C)

for k=1:N_feature,
    fprintf('Data in Bin %d', k);
    B = wff(:,k);
    %A = input_input';
    A = input_temp(:,k);
    B = logical(B);
    output_ans = A(B)

   % output_ans(k) = A(B);
end


disp('First fit (FFD) method: ')
occpff=u*wff;
disp(['Total # of bins used = ' int2str(sum([occpff > 0]))]);
nbinff=sum([occpff > 0]);
disp('the occupancy of each bin after packing are:');
disp(occpff(1:nbinff))
end
% ******************************************************************************* %




% ****************************   BFD method  ****************************** %
if chosen==0 | chosen==2,  % first fit method
wbf=w; rbf=r; % initialize for best fit method
for i=1:n,
   % disp(['u(' int2str(i) ') = ' int2str(u(i))]);
   % disp('r = '); disp(r);
   idx1=find([u(i)*ones(1,n) <= rbf]); % indices of bins still have spaces left
   [tmp,idx2]=min(rbf(idx1)-u(i));    % find the index within idx1 that best fits u(i)
   wbf(i,idx1(idx2))=1; rbf(idx1(idx2))=tmp; % update the state
   % disp('Press any key to continue ...'); pause
end
%wbf=wbf(irec,:); ; % sort it back to the original assignment order
%disp('% *******************************');
%disp('First fit decreasing (FFD) method: ')
disp('Best fit decreasing (BFD) method: ')
disp('the assignment are:')
disp(wbf)

N_feature = size(wbf,2);

input_temp = [u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u' u'];
% Q = [input_temp(:,1:4)]
% C = wff(:,1:4);
% C = logical(C);
% Q(C)
%show_out = input_temp(C)

for k=1:N_feature,
    fprintf('Data in Bin %d', k);
    B = wbf(:,k);
    %A = input_input';
    A = input_temp(:,k);
    B = logical(B);
    output_ans = A(B)

   % output_ans(k) = A(B);
end


disp('% *******************************');
disp('Best fit (BF) method: ')
% disp('the assignment are:')
% disp(wbf)
occpbf=u*wbf;
nbinbf=sum([occpbf > 0]);
disp(['Total # of bins used = ' int2str(nbinbf)]);
disp('the occupancy of each bin after packing are:');
disp(occpbf(1:nbinbf))

% occpffd=u*wffd;
% nbinffd=sum([occpffd > 0]);
% disp(['Total # of bins used = ' int2str(nbinffd)]);
% disp('the occupancy of each bin after packing are:');
% disp(occpffd(1:nbinffd))
% %disp(idx)
% % disp('Press any key to continue to Best fit method ...'); pause

end
% ******************************************************************************* %