Dynamic dual bin packing using fuzzy objectives

This paper presents the use of genetic algorithms (GA) for solving the dual bin packing problem using fuzzy objectives. In bin packing problems, a list, L of items is to be packed into a minimum number of bins. In dual bin packing the items are packed into a maximum number of bins, assuring a minimum weight for each bin. We consider a class which we call “dynamic dual bin packing”. As with online algorithms, the items must be packed sequentially, however seeing more than one item at a time. The number of bins being packed at any time is fixed. A bin is replaced by an empty one, as soon as it is filled. A GA is presented to solve this problem. The results show that the fuzzy packing scheme is essential to solving the problem, and due to the nature of the problem the GA behaves closely to that of a micro-GA