A fast sequential bin packing algorithm with predefined filllevel

The bin packing problem is widely studied due to its various applications, where the initial sole object is to find a minimum number of bins for the items. In the contrast, a multiple-objective mathematical model for the bin packing problem with multiple constraints is formulated. In an environment with finite packing resources, two novel bin packing algorithms are proposed in this paper. Therein, each bin is first given with a predefined filllevel. Then the bin will pack items by utilizing the first fit bin packing strategy when its current filllevel is no more than the threshold, or it will be closed. Experiments and analysis are carried out by the comparison with the traditional typical packing algorithms, which verifies the efficiency of the algorithm.