International Journal of Computational Intelligence Research
  • Year: 2010
  • Volume: 6
  • Issue: 1

Taxonomy of 2D Packing Problem

  • Author:
  • Kawaljeet Singh1, Leena Jain2,
  • Total Page Count: 20
  • Page Number: 97 to 116

1University Computer Centre, Punjabi University, Patiala, 147002, (India)

2Regional Institute of Management and Technology, Mandi Gobindgarh, 147301, (India);, University College of Engineering, Punjabi University, Patiala, 147 002, (India).

*Corresponding author

Abstract

Packing problems are optimization problem encountered in many areas of business that look for good arrangement of multiple items in larger containing regions. The objective of this problem is to maximize the utilization of resource material. The paper present and categorize 2D rectangle packing problem reported in the literature with an aim to identify different constraints and objectives associated with it. The classification of various forms of the packing problem and their range are the objective of the study undertaken.

Keywords

Packing problem, Trim loss, Assortment Problem, Strip packing, Bin packing, Stock Cutting Problem, Rectangle Packing, Knapsack