Research On Computational Approach To The Layout Optimization Problems In Satellite Capsule

The main topic of this thesis is solving the complex design of satellite module layout optimization. The heuristic information is combed with intelligent optimization technology to solve the case of two modes of satellite module layout problem. The performances of these methods are investigated by the computations on some benches.Firstly, the background of the general layout optimization problems is introduced, for leading to this research for the design of satellite module layout optimization. We illustrate the importance of the satellite module layout problem from the design of the satellite and the layout problem of the machine. The research methods are from easy to difficult, which is beginning from the problem of rectangle satellite module layout problem, ending in the problem of polygons satellite module packing problem.Secondly, for the approach to the satellite layout problem, it gets the idea that it is beneficial for using the heuristic information to the problem. We design different method for the special problem for ordering the layout objects. On the basis, two intelligent algorithm are designed which are ant colony algorithm and particle swarm optimization. They are explained from their principle and the background of application.Subsequently, the mathematical model of the rectangle satellite layout problem is given. By improving, the multi-objective problem is translated into single objective problem. The heuristic algorithm about Bottom Left Fill (BLF) strategy is used to layout the rectangle, which is figure, the geometric constraints out. Since then, the problem is translated to traveling salesman problem which is suited for ant colony optimization (ACO) algorithm to solve. Combing ACO, the order of the layout is optimal for getting best order. The results of numerical experiments show that our algorithm performs better than existing methods in space utilization and computing time.Finally, we expand the rectangles satellite layout problem to polygons; Use the Non-Fit Polygon to get the location of the polygons. The exact place is decided by computing the cent roil of the system. As the solution of the ordering case, the particle swarm optimization algorithm is combed to search optimization. The test illustrates the effectiveness of the algorithm. In short, we studied two models for the packing problem in satellite, and provide several algorithms for them. Our researches demonstrate that combination of the heuristic method and meta-heuristic method is a powerful tool for the layout problems in satellite.