Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet

DOI10.1016/j.ejor.2007.09.012zbMath1180.90263OpenAlexW1993020059MaRDI QIDQ948647

José Fernando Oliveira, Maria Teresa Costa, Antonio Miguel Gomes

Publication date: 17 October 2008

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

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

zbMATH Keywords

heuristicspackinglattice packingperiodic packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium ⋮ Models and algorithms for packing rectangles into the smallest square ⋮ Heuristics for the two-dimensional irregular bin packing problem with limited rotations ⋮ 2D Optimal Packing with Population Based Algorithms ⋮ Optimized Object Packings Using Quasi-Phi-Functions ⋮ A fully general, exact algorithm for nesting irregular shapes ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications

Uses Software

• TOPOS

Cites Work

• Unnamed Item
• Double-lattice packings of convex bodies in the plane
• Regular packing of congruent polygons on the rectangular sheet
• Packing problems
• TOPOS -- A new constructive algorithm for nesting problems
• A method of optimal lattice packing of congruent oriented polygons in the plane
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• Densest translational lattice packing of non-convex polygons
• A 2-exchange heuristic for nesting problems
• An improved typology of cutting and packing problems
• The closest packing of convex two-dimensional domains
• Packing and covering the plane with translates of a convex polygon
• Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
• An optimal algorithm for finding minimal enclosing triangles
• A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks
• Concepts of neighbourhood and universal compact yield towards achieving best pattern layouts

This page was built for publication: Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet