A hybrid genetic algorithm for 3D bin packing problems

3D bin packing problem has attracted the wide concern from OR community due to their generalization in many realistic applications. In this paper, a hybrid genetic algorithm is proposed for 3DBPP. Within the framework of the proposed algorithm, a special diploid representation scheme of individual is designed and the heuristic packing methods, which are derived from a deepest bottom left with fill packing method, are employed to accomplish the translation from the individual to a solution. In order to further improve the performance of algorithm, several special GA operations are also designed in this paper. An experimental study over a set of 3DBPP test problems shows that the proposed algorithm is efficient and adaptable to address 3DBPP.