Abstract: The Bin-packing problem is a widely researched subject and still being researched till present to reach solutions which are near optimum. There are many variants of the problem, depending on the objective of the research, each has multiple solutions proposed by researchers. In this research, we investigate a multi-objective 3D bin- packing problem and propose a novel algorithm where we consider the volume and weight as constraints and use the minimum number of bins to pack different-sized boxes. The resulting bins should be balanced as much as possible. The proposed solution is a layer-based approach, the proposed algorithm packs all boxes using horizontal layers, it has shown promising results in terms of number of bins and execution time and provides flexibility to be applied on different variations of the bin-packing problem. The results have been compared and successively validated with a theoretical lower bound and a previously published algorithm that tackled the same problem.