A topological order for a rectangular three dimensional bin packing problem

Authors:
Marinescu Daniela;Iacob Paul;Baicoianu Alexandra
Affiliations:
Transilvania University of Brasov, Department of Computer Science, Brasov, Romania;Transilvania University of Brasov, Department of Computer Science, Brasov, Romania;Transilvania University of Brasov, Department of Computer Science, Brasov, Romania
Venue:
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Year:
2008

Citing 3
Cited 3

Introduction to algorithms

Introduction to algorithms
A decomposition problem of a natural number for a rectangular cutting-covering model

ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
A topological order for a rectangular covering problem

ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers

A plan of lauding the boxes for a three dimensional bin packing model

WSEAS TRANSACTIONS on SYSTEMS
The determination of the guillotine restrictions for a rectangular three dimensional bin packing pattern

Proceedings of the 15th WSEAS international conference on Computers
A test of the guillotine restrictions determination for a rectangular three dimensional bin packing problem

WSEAS Transactions on Information Science and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper extends the previous work [9] regarding the two dimensional covering problem to a rectangular three dimensional bin packing problem, where a bin is packed with a set of rectangular boxes, without gaps or overlapping. Our objective is to determine an order of the loading the boxes in the bin so that a box is packed in the bin only if there are no empty spaces down to this box and the origin of the box is in a fixed position. We define a graph representation, similarly with [10, 11], of the packing model so that to obtain an acyclic graph. Starting from this graph it is possible to obtain a topological order of the boxes. At the end we present a kind of topological sorting algorithm for this problem, of linear complexity.