A MIP approach for some practical packing problems: Balancing constraints and tetris-like items

This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is quite frequent in space engineering and a real-world application deals with the Automated Transfer Vehicle project (funded...

Full description

Saved in:
Bibliographic Details
Published in4OR Vol. 2; no. 2; pp. 161 - 174
Main Author Fasano, Giorgio
Format Journal Article
LanguageEnglish
Published Heidelberg Springer Nature B.V 01.07.2004
Subjects
Automated Transfer Vehicle
Balancing
Heuristic
Heuristic methods
Integer programming
Linear programming
Mixed integer
Operations research
Parallelepipeds
Rotation
Studies
Online AccessGet full text

Cover

More Information
Summary:This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is quite frequent in space engineering and a real-world application deals with the Automated Transfer Vehicle project (funded by the European Space Agency), at present under development. A Mixed Integer Programming (MIP) approach is proposed. The three-dimensional single bin packing problem is considered. It consists of orthogonally placing, with possibility of rotation, the maximum number of parallelepipeds into a given parallelepiped. A MIP formulation of the problem is reported together with a MIP-based heuristic approach. Balancing conditions are furthermore examined, as well as the orthogonal placement (with rotation) of tetris-like items into a rectangular domain.[PUBLICATION ABSTRACT]
ISSN:1619-4500
1614-2411
DOI:10.1007/s10288-004-0037-7