带平衡约束的圆和矩形正交Packing问题的拟物拟人算法研究-计算机科学与技术专业论文.docx

II II Abstract To solve the layout design problem of satellite module (SMLD) which belongs to 3D combinatorial optimization problem with performance constraints, it is necessary to simplify all components into some cylinders and cuboids. If each of the components of the satellite module is vertically placed on the corresponding bearing plate, this problem will be converted into the 2D circle and rectangle packing problem with performance constraints. For the circular container with fixed volume, the aim of SMLD is to minimize the radius of the outside envelope circle of layout system as small as possible and satisfy the geometric constraints and equilibrium constraints of the layout system. By so far, many scholars at home or abroad have proposed many effective algorithms including heuristic algorithms (e.g. quasi-physical and quasi-human algorithm), evolutionary algorithms (e.g. genetic algorithm, particle swarm optimization and ant colony algorithm), cooperation algorithms and human-machine interactive algorithms. However, it still needs to be further studied the power approach owing to some deficiencies for them. Quasi-physical and Quasi-human algorithm is a kind of known algorithm for circle layout problem. But it is difficult to solve the rectangle layout problem with performance constraints and the circle and rectangle layout problem with performance constraints. In addition, the performance of evolution algorithms still need to further improved. In order to break through the bottleneck of SMLD (interference quantity calculation problem), our research group devotes ourselves to explore more effective the mechanism and methods to solve the rectangle layout problem with equilibrium constraints, 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). This paper puts forward a kind of the quasi-physical and quasi-hum