Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Irregular packing problems: A review of mathematical models
Publication

Irregular packing problems: A review of mathematical models

Title
Irregular packing problems: A review of mathematical models
Type
Another Publication in an International Scientific Journal
Year
2020
Authors
Aline A. S. Leão
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Franklina M. B. Toledo
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Ramón Alvarez-Valdés
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
Vol. 282
Pages: 803-822
ISSN: 0377-2217
Publisher: Elsevier
Other information
Authenticus ID: P-00Q-MFT
Abstract (EN): Irregular packing problems (also known as nesting problems) belong to the more general class of cutting and packing problems and consist of allocating a set of irregular and regular pieces to larger rectangular or irregular containers, while minimizing the waste of material or space. These problems combine the combinatorial hardness of cutting and packing problems with the computational difficulty of enforcing the geometric non-overlap and containment constraints. Unsurprisingly, nesting problems have been addressed, both in the scientific literature and in real-world applications, by means of heuristic and metaheuristic techniques. However, more recently a variety of mathematical models has been proposed for nesting problems. These models can be used either to provide optimal solutions for nesting problems or as the basis of heuristic approaches based on them (e.g. matheuristics). In both cases, better solutions are sought, with the natural economic and environmental positive impact. Different modeling options are proposed in the literature. We review these mathematical models under a common notation framework, allowing differences and similarities among them to be highlighted. Some insights on weaknesses and strengths are also provided. By building this structured review of mathematical models for nesting problems, research opportunities in the field are proposed.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 20
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Synchronisation in vehicle routing: Classification schema, modelling framework and literature review (2024)
Another Publication in an International Scientific Journal
Soares, R; Marques, A; Pedro Amorim; Parragh, SN
Retail shelf space planning problems: A comprehensive review and classification framework (2021)
Another Publication in an International Scientific Journal
Teresa Bianchi Aguiar ; Alexander Hübner; Maria Antónia Carravilla; José Fernando Oliveira
Digitalization and omnichannel retailing: Innovative OR approaches for retail operations (2021)
Another Publication in an International Scientific Journal
Alexander Hübner; Pedro Amorim; Jan Fransoo; Dorothee Honhon; Heinrich Kuhn; Victor Martinez de Albeniz; David Robb
Cutting and packing (2007)
Another Publication in an International Scientific Journal
Jose Fernando Oliveira; Rua Dr. Roberto Frias; Gerhard Wascher
A literature review of economic efficiency assessments using Data Envelopment Analysis (2024)
Another Publication in an International Scientific Journal
Ana Maria Cunha Ribeiro dos Santos Ponces Camanho; Silva, MC; Piran, FS; Lacerda, DP

See all (91)

Recommend this page Top
Copyright 1996-2024 © Reitoria da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2024-11-08 22:31:16 | Acceptable Use Policy | Data Protection Policy | Complaint Portal