Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
From MaRDI portal
Publication:2160486
Recommendations
- Raster penetration map applied to the irregular packing problem
- Dealing with nonregular shapes packing
- A beam search implementation for the irregular shape packing problem
- An effective heuristic for the two-dimensional irregular bin packing problem
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
Cites work
- A 2-exchange heuristic for nesting problems
- 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 new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- 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
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Applied simulated annealing
- Compaction and separation algorithms for non-convex polygons and their applications
- Computing the intersection-depth to polyhedra
- Efficient overlap detection and construction algorithms for the bitmap shape packing problem
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- Fast neighborhood search for two- and three-dimensional nesting problems
- Guided local search and its application to the traveling salesman problem
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Irregular packing problems: a review of mathematical models
- Irregular packing using the line and arc no-fit polygon
- Raster penetration map applied to the irregular packing problem
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Solving the irregular strip packing problem via guided local search for overlap minimization
- TOPOS -- A new constructive algorithm for nesting problems
- The geometry of nesting problems: a tutorial
- Using a tabu search approach for solving the two-dimensional irregular cutting problem
Cited in
(5)- Meshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods
- An image convolution-based method for the irregular stone packing problem in masonry wall construction
- Solving the irregular strip packing problem via guided local search for overlap minimization
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
This page was built for publication: Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2160486)
