Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
From MaRDI portal
Publication:2160486
DOI10.1016/J.EJOR.2022.03.034OpenAlexW3157282176MaRDI QIDQ2160486FDOQ2160486
Authors: Shunji Umetani, Shohei Murakami 
Publication date: 3 August 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.04525
Cites Work
- TOPOS -- A new constructive algorithm for nesting problems
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Compaction and separation algorithms for non-convex polygons and their applications
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- A 2-exchange heuristic for nesting problems
- The geometry of nesting problems: a tutorial
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- A beam search implementation for the irregular shape packing problem
- Applied simulated annealing
- Irregular packing using the line and arc no-fit polygon
- A typology of cutting and packing problems
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- Solving the irregular strip packing problem via guided local search for overlap minimization
- An algorithm for polygon placement using a bottom-left strategy
- A tutorial in irregular shape packing problems
- A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
- Using a tabu search approach for solving the two-dimensional irregular cutting problem
- Guided local search and its application to the traveling salesman problem
- Computing the intersection-depth to polyhedra
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Irregular packing problems: a review of mathematical models
- Raster penetration map applied to the irregular packing problem
- Efficient overlap detection and construction algorithms for the bitmap shape packing 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
Uses Software
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)
