An effective heuristic for the two-dimensional irregular bin packing problem
From MaRDI portal
Publication:363571
DOI10.1007/S10479-013-1341-4zbMATH Open1271.90070OpenAlexW2062694247MaRDI QIDQ363571FDOQ363571
Hugo Terashima-Marín, Eunice López-Camacho, Gabriela Ochoa, Edmund K. 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
Recommendations
- Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Matheuristics for the irregular bin packing problem with free rotations
- Two-Dimensional Finite Bin-Packing Algorithms
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Solution approaches to irregular nesting problems
- A 2-exchange heuristic for nesting problems
- The geometry of nesting problems: a tutorial
- An improved typology of cutting and packing problems
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- 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
- A typology of cutting and packing problems
- Title not available (Why is that?)
- A hybrid placement strategy for the three-dimensional strip packing problem
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- An algorithm for polygon placement using a bottom-left strategy
- Jostling for position: local improvement for irregular cutting patterns
- A tutorial in irregular shape packing problems
- A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
Cited In (13)
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- Descending packing algorithm for irregular graphics based on geometric feature points
- Title not available (Why is that?)
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Matheuristics for the irregular bin packing problem with free rotations
- 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
- A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
Uses Software
This page was built for publication: An effective heuristic for the two-dimensional irregular bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q363571)
