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

DOI10.1016/J.EJOR.2006.03.011MaRDI QIDQ858412zbMATH OpenOpenAlexFDO

Authors R. S. R. Hellier, Glenn Whitwell, Edmund K. 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) Mixed volumes and related topics in convex geometry (52A39) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• The irregular nesting problem: a new approach for nofit polygon calculation
• On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
• A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
• A local search approach for two-dimensional irregular cutting
• Generating Fenchel Cutting Planes for Knapsack Polyhedra
• An approximation algorithm for cutting out convex polygons
• scientific article; zbMATH DE number 2079417
• Exact approaches for the unconstrained two-dimensional cutting problem with defects

Cites work

• scientific article; zbMATH DE number 3825165 (Why is no real title available?)
• scientific article; zbMATH DE number 3986641 (Why is no real title available?)
• scientific article; zbMATH DE number 4051003 (Why is no real title available?)
• scientific article; zbMATH DE number 1182945 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A 2-exchange heuristic for nesting problems
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
• A new algorithm for the minimal-area convex enclosure problem
• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
• A typology of cutting and packing problems
• An algebra of polygons through the notion of negative shapes
• An algorithm for polygon placement using a bottom-left strategy
• Compaction and separation algorithms for non-convex polygons and their applications
• Computational Geometry in C
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Jostling for position: local improvement for irregular cutting patterns
• Modeling of packing problems
• Packing problems
• Polygon decomposition for efficient construction of Minkowski sums
• 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.
• \(\Phi\)-functions for complex 2D-objects

Cited in

(31)

• Irregular packing: MILP model based on a polygonal enclosure
• Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
• Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues
• Tools of mathematical modeling of arbitrary object packing problems
• Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
• The irregular nesting problem: a new approach for nofit polygon calculation
• A beam search implementation for the irregular shape packing problem
• Solving the irregular strip packing problem via guided local search for overlap minimization
• How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem
• Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
• A measure of non-convexity in the plane and the Minkowski sum
• Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers
• Irregular packing problems: a review of mathematical models
• scientific article; zbMATH DE number 7310225 (Why is no real title available?)
• Improving the efficiency of logic-based benders decomposition for p-batch scheduling problems with two-dimensional packing
• A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
• Algorithms for nesting with defects
• An effective heuristic for the two-dimensional irregular bin packing problem
• An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
• Irregular packing using the line and arc no-fit polygon
• An emergent computation approach to the problem of polygon layout with performance constraints
• An improved method for calculating the no-fit polygon
• A fully general, exact algorithm for nesting irregular shapes
• Using helical polyhedron for online irregular strip packing problem with free rotations
• A general heuristic approach for maximum polygon packing (CG challenge)
• Heuristics for the two-dimensional irregular bin packing problem with limited rotations
• Irregular stock cutting system based on AutoCAD
• A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems

Describes a project that uses

Uses Software

• TOPOS

This page was built for publication: Complete and robust no-fit polygon generation for the irregular stock cutting problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858412)