Dealing with nonregular shapes packing
type: Item
instance of: scholarly article
title: Dealing with nonregular shapes packing
zbMATH Open document ID: 1407.90275
DOI: 10.1155/2014/548957
author: Bonfim Amaro Júnior
author: Rommel Dias Saraiva
author: Pedro Gabriel Calíope Dantas Pinheiro
author: Placido Rogerio Pinheiro
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 7016725
Wikidata QID: Q59065952
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/548957
OpenAlex ID: W1973286186
cites work: An improved typology of cutting and packing problems
cites work: A hybrid approach of bundle and Benders applied large mixed linear integer problem
cites work: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
cites work: On genetic algorithms for the packing of polygons
cites work: TOPOS -- A new constructive algorithm for nesting problems
cites work: Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
cites work: Fast neighborhood search for two- and three-dimensional nesting problems
cites work: A beam search implementation for the irregular shape packing problem
cites work: Q4079017
cites work: Q4692508
cites work: Orthogonal Packings in Two Dimensions
description: scientific article; zbMATH DE number 7016725