An effective heuristic for the two-dimensional irregular bin packing problem
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 2040652 (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 SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
- A beam search implementation for the irregular shape packing problem
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- A hybrid placement strategy for the three-dimensional strip packing problem
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- A tutorial in irregular shape packing problems
- A typology of cutting and packing problems
- An algorithm for polygon placement using a bottom-left strategy
- An improved typology of cutting and packing problems
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- Jostling for position: local improvement for irregular cutting patterns
- Solution approaches to irregular nesting problems
- The geometry of nesting problems: a tutorial
Cited in
(18)- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Descending packing algorithm for irregular graphics based on geometric feature points
- scientific article; zbMATH DE number 5911854 (Why is no real title available?)
- Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- Coordinate descent heuristics for the irregular strip packing problem of rasterized 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
- Placement of two- and three-dimensional irregular shapes for inertia moment and balance
- 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
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)
