Irregular packing: MILP model based on a polygonal enclosure
From MaRDI portal
Publication:256688
DOI10.1007/s10479-015-1971-9zbMath1332.90228MaRDI QIDQ256688
Miguel Cezar Santoro, Felipe Kesrouani Lemos
Publication date: 9 March 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1971-9
strip packing; cutting and packing; disjunctive formulation; mixed integer-linear programming; nesting; polygonal packing; two-dimensional packing
Uses Software
Cites Work
- Tools of mathematical modeling of arbitrary object packing problems
- Generalized hyper-heuristics for solving 2D regular and irregular packing 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
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- A beam search implementation for the irregular shape packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Cutting and packing. Special issue
- Solution approaches to irregular nesting problems
- Compaction and separation algorithms for non-convex polygons and their applications
- On genetic algorithms for the packing of polygons
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- A 2-exchange heuristic for nesting problems
- Mathematical model and efficient algorithms for object packing problem
- Mixed-integer programming models for nesting problems
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- 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 hybrid approach for packing irregular patterns using evolutionary strategies and neural network
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- A tabu thresholding implementation for the irregular stock cutting problem
