Heuristic Algorithm for the Packing Problem of Satellite Module with Dynamic Unbalance Constraints

Under the background of the three-dimensional layout design of objects on the loading plate in the satellite module,a hybrid layout problem of cylinders and cuboids with dynamic unbalance constraints is studied.The two-stage method is introduced to solve this problem.At first,based on base-plane allocation criterion,all objects are allocated to up and down base-planes of the loading plate.Then the tabu search method is used to optimize the layout of objects on each base-plane.By putting forward heuristic generating strategies of the neighborhood configuration,and improving taboo object and the configuration acceptance criterion in the general tabu search algorithm,a heuristic algorithm which combines the improved tabu search algorithm with the local search based on gradient descent method is put forward.Experimental results on two instances from the literature show that the proposed algorithm is quite effective.