This paper reviews two and three-dimensional packing problems and their solution utilising genetic algorithms. The dimensions and the geometry of the figures involved in the allocation process classify packing problems. Since the genetic representation of the problem is vital to the performance of the genetic algorithm, particular emphasis is put on the techniques used for the representation of the problem and the genetic operators. With most of the approaches being hybrid genetic algorithms their decoding strategies are also briefly discussed.
Mendeley saves you time finding and organizing research
There are no full text links
Choose a citation style from the tabs below