Layout optimization for the objects located within a rotating vessel  a three-dimensional packing problem with behavioral constraints
This paper studies the layout optimization problem of the simplified vessel of satellite which moves spirally. It is a three-dimensional packing problem with dynamical equilibrium constraints, and is known as NP-hard problem. A solution strategy for such a problem is proposed and corresponding heuristic algorithms are presented in this paper. Numerical examples are illustrated to verify the effectiveness of the proposed algorithms. How to cut garments out of cloth, how to cut or stamp pieces from steel plate, and how to put objects into a container, etc., without overlaps and with high utility of materials of space, all these belong to cutting and packing problems without constraints. These are old problems initiated scores of years ago, the planar versions of which have been studied extensively and most of them have been solved satisfactorily. But there is a lot of work to be done for the three-dimensional ones. Suppose we put objects into a rotating vessel or container, we must additionally consider dynamical equilibrium demands and some other specified features. This is a three-dimensional packing problem with behavioral contraints, which is often encountered in many high technological fields, such as satellites, spacecrafts, rotating vessels and underwater suspended engineerings, etc. This paper studies such a problem and proposes a solution strategy and algorithms.
layout optimization heuristic algorithm 3-d packing problem