A test of the guillotine restrictions determination for a rectangular three dimensional bin packing problem

Authors:
Daniela Marinescu;Alexandra Băicoianu
Affiliations:
Transilvania University of Braşov, Department of Computer Science, Braşov, Romania;Transilvania University of Braşov, Department of Computer Science, Braşov, Romania
Venue:
WSEAS Transactions on Information Science and Applications
Year:
2011

Citing 7
Cited 0

Introduction to algorithms

Introduction to algorithms
A topological order for a rectangular three dimensional bin packing problem

ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
An algorithm for the guillotine restrictions verification in a rectangular covering model

WSEAS Transactions on Computers
Multi-dimensional bin packing problems with guillotine constraints

Computers and Operations Research
An algorithm for determination of the guillotine restrictions for a rectangular cutting-stock pattern

WSEAS Transactions on Computers
The determination of the guillotine restrictions for a rectangular cutting-stock pattern

ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
The determination of the guillotine restrictions for a rectangular three dimensional bin packing pattern

Proceedings of the 15th WSEAS international conference on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is an extended version of the paper [9] regarding to the rectangular three dimensional bin packing problem, where a bin is loaded with a set of rectangular boxes, without overlapping but with possible gaps. One of the most popular restriction for the solution of the 3D-bin packing problem is the guillotine restriction. The guillotine restriction requires that the packing patterns should be such that the boxes can be obtained recursively by cutting the bin in two smaller bins, until each bin will contains only one box and no box has been intersected by a cut. Our objective is to find a method to verify if a 3D bin-packing pattern has the guillotine constrains or not. For this purpose we use a weighed graph representations of a solution of the problem, the generalisation of this kind of representation obtained by us for 2D cutting-stock problem in [10, 11, 12].