The bin packing problem is a well-studied combinatorial NP-hard problem. In the bin packing problem, a sequence of items are packed into bins, the packed items in a bin do not overlap. The objective is to minimize the number of used bins. The size of each item should be no more than the size of a bin. (Zhang, 2011) The algorithms can be divided into two categories: offline algorithm, requiring ...