Layout Algorithms For Simplified Three-dimensional Satellite Module Layout Problem With Performance Constraints

The satellite module layout problem, which is a three-dimensional layout optimization problem with performance constraints, has been proved to be an NP-hard problem. Although accurate solution has not been found as in classical mathematical problem, finding the optimal solution or approximate solution for this typical NP-hard problem of layout optimization is rather important for solving the NP-hard problem.This article takes a simplified international commercial communication satellite module (INTELSAT-III) as an example, and studies the layout optimization problem with a number of objects on the bearing plates of the simplified satellite module. Firstly, based on the different objects, we establish the different references coordinate systems of the simplified satellite module. Then we transform the constrained optimization problem into an unconstrained optimization problem by using penalty function method. Lastly, we use the proposed heuristic algorithms to optimize the objective function and get the optimal layout. Specific studies and results in this paper are as follows:(1)Study a new energy landscape paving (nELP) algorithm for simplified three-dimensional satellite module layout problem with performance constraints. By putting forward a new update mechanism of the histogram function in energy landscape paving (ELP), we obtain an improved ELP method which can jump out of the narrow and deep valleys of energy landscape in the search process to solve this problem. By incorporating the gradient method with local search into the improved ELP method, a new global search optimization method is proposed for satellite module layout problem which is a three-dimensional layout optimization problem with performance constraints problem. The computational results show that the moment of inertia simulated by nELP algorithm breaks the records of the two instances both in the average result and best result.(2) We study the redistribution of the objects in the simplified satellite module, and the layout optimize method with heuristic. Firstly, we redistribute those objects to four plates of the simplified satellite module with the heuristic distributed strategies. Then we transform the circle objects into the rectangle objects, and update the layout with corner occupying strategy; At last, we use the steepest descent method to further optimize the layout updated. We test the instance of 60 objects, the experimental results show that the effectiveness of the proposed algorithm and redistribution strategy.