An effective heuristic for the two-dimensional irregular bin packing problem

DOI10.1007/s10479-013-1341-4zbMath1271.90070OpenAlexW2062694247MaRDI QIDQ363571

Hugo Terashima-Marín, Eunice López-Camacho, Gabriela Ochoa, Edmund Kieran Burke

Publication date: 3 September 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1341-4

zbMATH Keywords

heuristics2D bin packing problemdjang and finch heuristicirregular packing

Mathematics Subject Classification ID

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

Related Items

Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations ⋮ Heuristics for the two-dimensional irregular bin packing problem with limited rotations ⋮ Descending packing algorithm for irregular graphics based on geometric feature points ⋮ Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning ⋮ Matheuristics for the irregular bin packing problem with free rotations ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry

Uses Software

• TOPOS

Cites Work

• Unnamed Item
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems
• A hybrid placement strategy for the three-dimensional strip packing problem
• A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• A beam search implementation for the irregular shape packing problem
• Solution approaches to irregular nesting problems
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• A typology of cutting and packing problems
• A 2-exchange heuristic for nesting problems
• An algorithm for polygon placement using a bottom-left strategy
• The geometry of nesting problems: a tutorial
• An improved typology of cutting and packing problems
• A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
• Jostling for position: local improvement for irregular cutting patterns
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
• A tutorial in irregular shape packing problems
• A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM