Application of Genetic Algorithm for the Bin Packing Problem with a New Representation Scheme

The Bin Packing Problem (BPP) is to find the minimum number of binsneeded to pack a given set of objects of known sizes so that they donot exceed the capacity of each bin. This problem is known to beNP-Hard [5]; hence many heuristic procedures for its solution havebeen suggested. In this paper we propose a new representation schemeand solve the problem by a Genetic Algorithm. Limited computationalresults show the efficiency of this scheme.