Exportar Publicação
A publicação pode ser exportada nos seguintes formatos: referência da APA (American Psychological Association), referência do IEEE (Institute of Electrical and Electronics Engineers), BibTeX e RIS.
de Almeida, A. & Figueiredo, M. (2010). A particular approach for the 3-dimensional packing problem with additional constraints. Computers and Operations Research. 37 (11), 1968-1976
A. M. Almeida and M. B. Figueiredo, "A particular approach for the 3-dimensional packing problem with additional constraints", in Computers and Operations Research, vol. 37, no. 11, pp. 1968-1976, 2010
@article{almeida2010_1766220862294,
author = "de Almeida, A. and Figueiredo, M.",
title = "A particular approach for the 3-dimensional packing problem with additional constraints",
journal = "Computers and Operations Research",
year = "2010",
volume = "37",
number = "11",
doi = "10.1016/j.cor.2010.01.010",
pages = "1968-1976",
url = "http://www.sciencedirect.com/science/article/pii/S0305054810000213"
}
TY - JOUR
TI - A particular approach for the 3-dimensional packing problem with additional constraints
T2 - Computers and Operations Research
VL - 37
IS - 11
AU - de Almeida, A.
AU - Figueiredo, M.
PY - 2010
SP - 1968-1976
SN - 0305-0548
DO - 10.1016/j.cor.2010.01.010
UR - http://www.sciencedirect.com/science/article/pii/S0305054810000213
AB - This paper focus a restrained concretization of the general NP-hard Container Loading Problem that
arises from a real world application. This particular problem can be informally described as: given
dierent sets of bins and boxes, nd the packing of the boxes into the smallest number of bins obeying
some additional restrictions on the placement. The mathematical programming formulation that appears
to better model this application is the Three-dimensional Bin{Packing Problem (3D{BPP) which is no more that an extension of the classic Bin{Packing Problem to the orthogonal packing of solid objects.
An alternate non-linear formulation for the 3D{BPP problem version as well as the numerical results of
new designed heuristic algorithms (CPBOX and BOXCP) for the approximation of the optimal solution
using boxes and bins of heterogeneous dimensions. Moreover, we also present a heuristic specically
designed to work under very particular storage application restrictions. The numerical results indicate that all of these new heuristics have good performance standards specially when applied to replications of real input data.
ER -
English