Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes

DOI10.1016/j.ejor.2022.03.034OpenAlexW3157282176MaRDI QIDQ2160486

Shohei Murakami, Shunji Umetani

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

zbMATH Keywords

packingraster modelnesting problemirregular strip packing problemcoordinate descent heuristics

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• TOPOS

Cites Work

• 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
• 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
• Applied simulated annealing
• TOPOS -- A new constructive algorithm for nesting problems
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
• Guided local search and its application to the traveling salesman problem
• A typology of cutting and packing problems
• A 2-exchange heuristic for nesting problems
• An algorithm for polygon placement using a bottom-left strategy
• Irregular packing problems: a review of mathematical models
• Raster penetration map applied to the irregular packing problem
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
• Computing the intersection-depth to polyhedra
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• 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
• Irregular Packing Using the Line and Arc No-Fit Polygon
• A tutorial in irregular shape packing problems
• Solving the irregular strip packing problem via guided local search for overlap minimization
• A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
• EFFICIENT OVERLAP DETECTION AND CONSTRUCTION ALGORITHMS FOR THE BITMAP SHAPE PACKING PROBLEM

This page was built for publication: Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes