Optimal Layout Design of a Satellite Module Using a Coevolutionary Method with Heuristic Rules

The layout design of a satellite module belongs to a three-dimensional (3D) packing problem with mutual-conflicting performance constraints. Taking the layout design of a simplified commercial communication satellite as a background, based on the cooperative coevolutionary framework, this paper presents a coevolutionary method with heuristic rules for the optimal layout design of a satellite module. First, a whole satellite module layout problem is decomposed into several sublayout problems according to the multisubphysical structure of a satellite module. Second, a relaxation model is adopted to distribute all objects among subspaces. Third, a coevolutionary genetic algorithm is adopted to solve the detailed layout design within the subspaces. Finally, a heuristic combination-rotation (CR) method is adopted to adjust the constraints to obtain the final whole layout scheme. Compared with the coevolutionary approach and the all-at-once optimization approaches, computational results show that the CR method ...

[1]  Anup Kumar,et al.  A Genetic Algorithm for Packing Three-Dimensional Non-Convex Objects Having Cavities and Holes , 1997, ICGA.

[2]  Hong-Fei Teng,et al.  Optimal layout design of a satellite module , 2003 .

[3]  Kenneth A. De Jong,et al.  A Cooperative Coevolutionary Approach to Function Optimization , 1994, PPSN.

[4]  Mark J. Jakiela,et al.  Solving Pattern Nesting Problems with Genetic Algorithms Employing Task Decomposition and Contact Detection , 1995, Evolutionary Computation.

[5]  Huang,et al.  AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .

[6]  C. B. Lucasius,et al.  Multicriteria target vector optimization of analytical procedures using a genetic algorithm , 1993 .

[7]  Guntram Scheithauer,et al.  A branch&bound algorithm for solving one-dimensional cutting stock problems exactly , 1995 .

[8]  Martina Gorges-Schleuter,et al.  Application of Genetic Algorithms to Task Planning and Learning , 1992, Parallel Problem Solving from Nature.

[9]  R. Balling,et al.  Optimal packaging of complex parametric solids according to mass property criteria , 1994 .

[10]  Jonathan Cagan,et al.  A survey of computational approaches to three-dimensional layout problems , 2002, Comput. Aided Des..

[11]  P. Y. Wang,et al.  Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..

[12]  Simon Szykman,et al.  Constrained Three-Dimensional Component Layout Using Simulated Annealing , 1997 .

[13]  C. B. Lucasius,et al.  Multicriteria target vector optimization of analytical procedures using a genetic algorithm: Part I. Theory, numerical simulations and application to atomic emission spectroscopy , 1992 .

[14]  R. Paul Wiegand,et al.  An empirical analysis of collaboration methods in cooperative coevolutionary algorithms , 2001 .

[15]  Hong-fei Teng,et al.  Layout optimization for the objects located within a rotating vessel - a three-dimensional packing problem with behavioral constraints , 2001, Comput. Oper. Res..

[16]  Xiaojian Liu,et al.  Genetic approach to optimal topology/controller design of adaptive structures , 1998 .

[17]  Jonathan Cagan.  Shape annealing solution to the constrained geometric knapsack problem , 1994, Comput. Aided Des..

[18]  Jonathan Cagan,et al.  A Simulated Annealing-Based Approach to Three-Dimensional Component Packing , 1995 .

[19]  Georges M. Fadel,et al.  A GA Based Configuration Design Optimization Method , 2004 .

[20]  W. Hills,et al.  A Layout Design System for Complex Made-to-order Products , 1996 .

[21]  John E. Beasley,et al.  An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

[22]  Teng Hong.  Complex layout optimization problem: layout scheme design of spacecraft module , 2001 .

[23]  Jonathan Cagan,et al.  Exploring the Effectiveness of Various Patterns in an Extended Pattern Search Layout Algorithm , 2004 .