Dealing with nonregular shapes packing
Summary: This paper addresses the irregular strip packing problem, a particular two-dimensional cutting and packing problem in which convex/nonconvex shapes (polygons) have to be packed onto a single rectangular object. We propose an approach that prescribes the integration of a metaheuristic engine (i.e., genetic algorithm) and a placement rule (i.e., greedy bottom-left). Moreover, a shrinking algorithm is encapsulated into the metaheuristic engine to improve good quality solutions. To accomplish this task, we propose a no-fit polygon based heuristic that shifts polygons closer to each other. Computational experiments performed on standard benchmark problems, as well as practical case studies developed in the ambit of a large textile industry, are also reported and discussed here in order to testify the potentialities of proposed approach.
- Irregular packing: MILP model based on a polygonal enclosure
- A tutorial in irregular shape packing problems
- Raster penetration map applied to the irregular packing problem
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins
- A beam search implementation for the irregular shape packing problem
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- An improved typology of cutting and packing problems
- 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
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- On genetic algorithms for the packing of polygons
- Orthogonal Packings in Two Dimensions
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- TOPOS -- A new constructive algorithm for nesting problems
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Packing solar cells on a roof
- Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins
- A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- Non-uniform packings
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- Descending packing algorithm for irregular graphics based on geometric feature points
- Raster penetration map applied to the irregular packing problem
- Irregular packing: MILP model based on a polygonal enclosure
- scientific article; zbMATH DE number 1708107 (Why is no real title available?)
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- Jostling for position: local improvement for irregular cutting patterns
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
- A tutorial in irregular shape packing problems
- Placement of two- and three-dimensional irregular shapes for inertia moment and balance
- scientific article; zbMATH DE number 1070405 (Why is no real title available?)
- Geometric Packing under Nonuniform Constraints
- Two-dimensional bin packing, cutting stock, and open dimension problems: a survey of practical requirements
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- A beam search implementation for the irregular shape packing problem
This page was built for publication: Dealing with nonregular shapes packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1718651)
