solvetrp.m

来自「an implementation of best fit in matlab」· M 代码 · 共 24 行

clear all

binCapacity = 30;
palletDemand = [9 7 5 4 8 8 7 6 6 6 4 6];  

[binAssignment,numberOfBins,occupancyInEachBin] = bestFit(binCapacity,palletDemand);

tempVector = [];

for i=1:length(binAssignment)
    for j=1:length(binAssignment)
        if binAssignment(j,i)==1
            tempVector = [tempVector j];
        end
    end
    if sum(tempVector)>0
        tempVector
    end
    clear('tempVector');
    tempVector = [];
end

numberOfBins
occupancyInEachBin