• 1 Introduction
  • 2 Previous work
  • 3 The genetic algorithm for the 2D knapsack problem
  • 3.1 Layer structure of generated packing plans
  • 3.2 Representation of solutions and fitness
  • 3.3 Algorithm of the genetic search and operators
  • 3.4 Completing solutions
  • 3.5 Filling a layer – first heuristic
  • 3.6 Filling a layer – second heuristic
  • 3.7 Heuristic for post-optimization
  • 3.8 Variants of the genetic algorithm
  • 4 Testing the method
  • 4.1 Problem instances and comparison methods for the test
  • 4.2 Numerical results
  • 5 Summary
  • Bibliography