On Packing 2D Irregular Shapes
نویسندگان
چکیده
Designing and implementing an intelligent system that tackles the problem of placing two-dimensional shapes on a surface, such that no shapes overlap and the uncovered surface area is minimized, is highly important in industrial applications. However, it is also interesting from the scientific perspective, in terms of artificial intelligence, since autonomous systems developed up to now have found it difficult to compete with humans in this task. This paper presents a new algorithm which addresses the on-line packing of two-dimensional irregular shapes, and achieves high quality solutions in short computational times. The key point of this algorithm is the utilization of techniques drawn from computer vision and artificial intelligence.
منابع مشابه
A Novel Toolbox for Generating Realistic Biological Cell Geometries for Electromagnetic Microdosimetry
Researchers in bioelectromagnetics often require realistic tissue, cellular and sub-cellular geometry models for their simulations. However, biological shapes are often extremely irregular, while conventional geometrical modeling tools on the market cannot meet the demand for fast and efficient construction of irregular geometries. We have designed a free, user-friendly tool in MATLAB that comb...
متن کامل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 a...
متن کاملProblem Generators for Rectangular packing problems
In order to verify and test the performance of new packing algorithms relative to existing algorithms, test problems are needed. The scope of published test instances for 2D rectangular and irregular packing has been fairly limited in terms of object size, number and dimension of items. A systematic investigation into the performance of new algorithms requires the use of a range of test problem...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملConstruction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
The paper examines a new problem in the irregular packing literature that has existed in industry for decades; two-dimensional irregular (convex) bin packing with guillotine constraints. Due to the cutting process of certain materials, cuts are restricted to extend from one edge of the stock-sheet to another, called guillotine cutting. This constraint is common place in glass cutting and is an ...
متن کامل