A Review of the Application of Swarm Intelligence Algorithms to 2D Cutting and Packing Problem

摘要

Cutting and packing (C & P) problem is to allocate a set of items to larger rectangular standardized units by minimizing the waste. Bin packing, strip packing and cutting stock problem is well-known classical C & P problem. An overview is provided of several meta-heuristics algorithms of swarm intelligence from the literature for the 2D C & P problem. The objective of this paper is to present and categorize the solution approaches in the literature for 2D regular and irregular C & P problem. The focus is hereby on the analysis of the methods and application of swarm intelligence algorithms.