Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm

In this paper, we address the Constrained Three-dimensional Guillotine Cutting Problem (C3GCP), which consists of cutting a larger cuboid block (object) to produce a limited number of smaller cuboid pieces (items) using orthogonal guillotine cuts only. This way, all cuts must be parallel to the obje...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Expert systems with applications 2021-04, Vol.168, p.114257, Article 114257
Hauptverfasser:	Martin, Mateus, Oliveira, José Fernando, Silva, Elsa, Morabito, Reinaldo, Munari, Pedro
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Bedding Bottom-up packing Constrained three-dimensional cutting Constraints Containers Cutting Cutting and packing Decision making Expert systems Integer programming Linear programming Loading operations Mixed integer Mixed-integer linear programming models Non-staged and 3-staged patterns Nonlinear programming
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!