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.
layout optimization heuristic algorithm 3-d packing problem