A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem

In this paper we present a heuristic method to generate constrained two-dimensional guillotine cutting patterns. This problem appears in different industrial processes of cutting rectangular plates to produce ordered items, such as in the glass, furniture and circuit board business. The method uses...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of operations research Jg. 179; H. 1; S. 297 - 315
Hauptverfasser:	Morabito, Reinaldo, Pureza, Vitória
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.09.2010 Springer Springer Nature B.V
Schlagworte:	Algorithms Ascent Business and Management Circuit printing Combinatorics Constraints Cutting Cutting stock problem Dynamic programming Heuristic Heuristic methods Methods Operations research Operations Research/Decision Theory Optimization Packing problem Performance evaluation Printed circuits Searching Studies Theory of Computation Two dimensional Constrained two-dimensional guillotine cutting patterns Heuristics Dynamic programming And/or-graph search Cutting and packing problems
ISSN:	0254-5330, 1572-9338
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!