An algorithm for polygon placement using a bottom-left strategy
From MaRDI portal
Publication:1847183
DOI10.1016/S0377-2217(02)00131-5zbMath1081.90609MaRDI QIDQ1847183
Kathryn A. Dowsland, S. Vaid, William B. Dowsland
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (16)
Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory ⋮ Fast neighborhood search for two- and three-dimensional nesting problems ⋮ Complete and robust no-fit polygon generation for the irregular stock cutting problem ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes ⋮ An effective heuristic for the two-dimensional irregular bin packing problem ⋮ Generalized hyper-heuristics for solving 2D regular and irregular packing problems ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ Intelligent layout planning for rapid prototyping ⋮ Packing Optimization of Free-Form Objects in Engineering Design ⋮ A beam search implementation for the irregular shape packing problem ⋮ An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ Solving the irregular strip packing problem via guided local search for overlap minimization ⋮ A 2-exchange heuristic for nesting problems ⋮ A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
Uses Software
Cites Work
- Unnamed Item
- Compaction and separation algorithms for non-convex polygons and their applications
- An improved BL lower bound
- On genetic algorithms for the packing of polygons
- Applied simulated annealing
- TOPOS -- A new constructive algorithm for nesting problems
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- An algebra of polygons through the notion of negative shapes
- Jostling for position: local improvement for irregular cutting patterns
- Orthogonal Packings in Two Dimensions
This page was built for publication: An algorithm for polygon placement using a bottom-left strategy
