The Guillotine Two-Dimensional Packing Problems are a class of optimization problems that require to pack rectangular items into rectangular containers with the constraint that every packed item should be possibly retrieved with a series of vertical and horizontal cuts that divide the container into 2 parts without cutting items. 2 exact and 2 heuristic algorithms have been developed, to solve respectively the Guillotine Two-Dimensional Knapsack and the Guillotine Two-Dimensional Bin Packing
Algorithms for two-dimensional guillotine packing problems
Di Pieri, Alessandro
2013/2014
Abstract
The Guillotine Two-Dimensional Packing Problems are a class of optimization problems that require to pack rectangular items into rectangular containers with the constraint that every packed item should be possibly retrieved with a series of vertical and horizontal cuts that divide the container into 2 parts without cutting items. 2 exact and 2 heuristic algorithms have been developed, to solve respectively the Guillotine Two-Dimensional Knapsack and the Guillotine Two-Dimensional Bin PackingFile in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
Tesi_Magistrale.pdf
accesso aperto
Dimensione
1.53 MB
Formato
Adobe PDF
|
1.53 MB | Adobe PDF | Visualizza/Apri |
The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License
Utilizza questo identificativo per citare o creare un link a questo documento:
https://hdl.handle.net/20.500.12608/16757