带平衡约束圆与矩形Packing问题的启发式蚁群算法分析与应用-计算机科学与技术专业论文.docx

II II Abstract Satellite module layout design is a combinatorial optimization problem which means to find the optimal solution to palce all payloads of the satellite module in a specified space. It is also the research hotspot of combination mathematics and operational research. It concerns the knowledge of multi-subject and multi-domain such as logical reasoning, computer graphics, computational geometry, operational research and so on. Satellite module layout design belongs to the NP-hard problem because it can not find the exact solution in finite time. By simplifying the instruments and equipments into cylinders and cuboids placed vertical on bearing surfaces, satellite module layout design problem mainly contains the following three kinds of layout problems with performance constraints: (1) the circle packing problem with the performance constraints; (2) the rectangle packing problem with the performance constraints; (3) the circle and rectangle packing problem with the performance constraints. It is more difficult to solve the latter than the first two problems and the existing methods mainly contain evolutionary algorithm, collaborative design and interactive evolutionary algorithm. Time-consuming of the interference quantity calculation already becomes a bottleneck problem of further improving the solution accuracy and computational efficiency. This work is supported by a grant from the National Natural Science Foundation , Natural Science Foundation of Hunan Province (11JJ6050) and Research Foundation of Education Bureau of Hunan Province (11A120). Taking the layout design of the satellite model as research background, this paper studies the two-dimensional circle and rectangle packing problem with inertia constraints and proposes a heuristic ant colony optimization for this problem and a divide-conquer co-evolutionary algorithm for layout design of simplified international commercial communications satellite module. Numerical exprements show that