Application of genetic algorithms to packing problems—a review

  • Hopper E
  • Turton B
  • 22


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


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.

Author-supplied keywords

  • genetic algorithms
  • nesting
  • packing
  • review

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

There are no full text links


  • E Hopper

  • B Turton

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free