Solving the packing problem of rectangles with improved genetic algorithm based on statistical analysis

  • Authors:

  • Genhong Ding;Dan Li;Leng Chen

  • Affiliations:

  • Hohai University, Nanjing, China;Hohai University, Nanjing, China;Hohai University, Nanjing, China

  • Venue:
  • Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The genetic algorithm and the surplus rectangle algorithm are used for solving the orthogonal packing problem of rectangles. Based on statistical analysis of rectangular packing problem, a comparable standard for judgment of a solution has been proposed, which is adopted in classification of the parent population. A surplus rectangle algorithm is introduced to decode the permutation of rectangles to the corresponding packing pattern uniquely. For different constructions, corresponding genetic operations have been designed. And then an improved genetic algorithm has been constructed. Several rectangles packing problems have been solved by using this improved algorithm and the optimum packing results have been achieved. This shows that the improved genetic algorithm is efficacious.