A genetic approach for two dimensional packing with constraints

Abstract

In this paper, a new genetic algorithm based method is proposed for packing rectangular cargos of different sizes into a given loading area in a two dimensional framework. A novel penalty function method is proposed for checking the solution strings that have violated the loading area’s aspect constraints. This method penalizes the solution strings based on the extent by which they violate the length and breadth constraints. The results from the proposed genetic algorithm are compared with the popular heuristic method of Gehring et. al. to show the advantages of this method.