Complete and robust no-fit polygon generation for the irregular stock cutting problem

DOI10.1016/j.ejor.2006.03.011zbMath1175.90325OpenAlexW1977402971MaRDI QIDQ858412

R. S. R. Hellier, G. Whitwell, Edmund Kieran Burke, Graham Kendall

Publication date: 9 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.011

zbMATH Keywords

packingcuttingno-fit polygonorbital approach

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mixed volumes and related topics in convex geometry (52A39)

Related Items

A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums, Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers, An effective heuristic for the two-dimensional irregular bin packing problem, A measure of non-convexity in the plane and the Minkowski sum, An emergent computation approach to the problem of polygon layout with performance constraints, An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations, Tools of mathematical modeling of arbitrary object packing problems, Heuristics for the two-dimensional irregular bin packing problem with limited rotations, Algorithms for nesting with defects, A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems, Irregular stock cutting system based on AutoCAD, Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning, Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues, A fully general, exact algorithm for nesting irregular shapes, A beam search implementation for the irregular shape packing problem, Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem, Irregular packing problems: a review of mathematical models, Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry, Solving the irregular strip packing problem via guided local search for overlap minimization, Unnamed Item, Irregular packing: MILP model based on a polygonal enclosure, A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation

Uses Software

• TOPOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
• A new algorithm for the minimal-area convex enclosure problem
• Compaction and separation algorithms for non-convex polygons and their applications
• Packing problems
• Rotational polygon containment and minimum enclosure using only robust 2D constructions
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• A typology of cutting and packing problems
• A 2-exchange heuristic for nesting problems
• An algorithm for polygon placement using a bottom-left strategy
• \(\Phi\)-functions for complex 2D-objects
• An algebra of polygons through the notion of negative shapes
• Jostling for position: local improvement for irregular cutting patterns
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
• Modeling of packing problems
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Computational Geometry in C
• Polygon decomposition for efficient construction of Minkowski sums