Optimal Layout Design of a Satellite Module Using a Coevolutionary Method with Heuristic Rules
Publication: Journal of Aerospace Engineering
Volume 22, Issue 2
Abstract
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 can improve the computational accuracy of solutions and the proposed heuristic coevolutionary method can produces better solutions within short running times.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgments
This work is financially supported by the National Natural Science Foundation of China (Grant Nos. NSFC50575031 and NSFC60674078), the “863” Hi-Tech Research and Development Program of China (Grant No. UNSPECIFIED2006AA04Z109), and the “11-5” Science Technology Key Project (Grant No. UNSPECIFIEDJPPT-115-189).
References
Beasley, J. E. (1985). “An exact two-dimensional non-guillotine cutting tree search procedure.” Oper. Res., 33, 49–65.
Cagan, J. (1994). “Shape annealing solution to the constrained geometric knapsack problem.” Comput.-Aided Des., 26(10), 763–770.
Cagan, J., Shimada, K., and Yin, S. (2002). “A survey of computational approaches to the three-dimensional layout problems.” Comput.-Aided Des., 34(8), 597–611.
Coello, C. C. A. (1999). “A comprehensive survey of evolutionary based multiobjective optimization techniques.” Knowledge Inf. Syst., 1(3), 269–308.
Dai, Z., and Cha, J. (1994a). “A hybrid approach of heuristic, and neural network for packing problems.” Advances in Design Automation 1994: Proc., 20th ASME Design Automation Conf., Vol. 2, 117–123.
Dai, Z., and Cha, J. (1994b). “An Octree method for interference detection in computer aided 3-D packing.” Advances in Design Automation 1994: Proc., 20th ASME Design Automation Conf., Vol. 1, 29–33.
Dighe, R., and Jakiela, M. J. (1995). “Solving pattern nesting problems with genetic algorithms employing task decomposition and contact detection.” Evol. Comput., 3(3), 239–266.
Ge, W. H., and Teng, H. F. (1995). “Three-dimensional optimal layout of objects allocated inside a multi-cabin rotating vessel.” Proc., 18th Int. Conf. on Comupter & Industrial Engineering, Shanghai, China, 1315–1320.
Grignon, P. M., and Fadel, G. M. (2004). “A GA based configuration design optimization method.” Trans. ASME, J. Mech. Des., 126(1), 6–15.
Huang, M. D., Romeo, F., and Sangiovanni-Vincentelli, A. (1986). “An efficient general cooling schedule for simulated annealing.” Proc., ICCAD-86: IEEE International Conf. on Computer Aided Design—Digest of Technical Papers, Santa Clara, Calif., 381–384.
Ikonen, I., et al. (1997). “A genetic algorithm for packing three-dimensional non-convex objects having cavities and holes.” Proc., 7th Int. Conf. on Genetic Algorithms, East Lansing.
Intelsat III. (1995). “The Intelsat III satellite appearance.” ⟨http://www.astrovox.gr/images/intelsat.jpg⟩.
Jakob, W., Gorges-Schleutor, M., and Blume, C. (1992). “Application of genetic algorithms to task planning and learning.” Parallel Problem Solving from Nature, Proc., 2nd Workshop, Lecture Notes in Computer Science, R. Manner and B. Manderick, eds., North-Holland, Amsterdam, The Netherlands, 291–300.
Landon, M. D., and Balling, R. J. (1994). “Optimal packaging of complex parametric solids according to mass property criteria.” J. Mech. Des., 116, 375–381.
Liu, X. J., Begg, D. W., and Fishwick, R. J. (1998). “Genetic approach to optimal topology/controller design of adaptive structures.” Int. J. Numer. Methods Eng., 41, 815–830.
Potter, M. A., Kenneth, A., and De Jong, K. A. (1994). “A cooperative coevolutionary approach to function optimization.” Proc., 3rd Parallel Problem Solving from Nature, Jerusalem, Israel, 249–257.
Sandgree, E. (1994). “Multicriteria design optimization by goal programming.” Advance in design optimization, A. Hojjat, ed., Chapman & Hall, London, 225–265.
Scheithauer, G., and Terno, J. (1995). “A branch & bound algorithm for solving one-dimensional cutting stock problems exactly.” Aplicationes Mathematicae, 23(2), 151–167.
Shi, Y. J. (2005). “The cooperative co-evolutionary differential evolution and its applications for complex layout optimization.” Doctoral dissertation, Dalian Univ. of Technology, Dalian, P.R. China (in Chinese).
Smith, N., Hills, W., and Cleland, G. (1996). “A layout design system for complex made-to-order products.” J. Eng. Design, 7(4), 363–375.
Sun, Z. G. (2005). “Sequential and physical decomposition methods for a layout design problem of spacecrafts.” Doctoral dissertation, Dalian Univ. of Technology, Dalian, P.R. China (in Chinese).
Sun, Z. G., and Teng, H. F. (2003). “Optimal layout design of a satellite module.” Eng. Optimiz., 35(6), 513–529.
Szykman, S., and Cagan, J. (1995). “A simulated annealing approach to three-dimensional component packing.” ASME J. Mech. Des., 117(2A), 308–314.
Szykman, S., and Cagan, J. (1996). “Constrained three dimensional component layout using simulated annealing.” ASME J. Mech. Des., 119(1), 28–35.
Teng, H. F., et al. (2001a). “Complex layout optimization problem: Layout scheme design of spacecraft module.” J. Dalian University of Technology, 41(5), 551–558.
Teng, H. F., et al. (2001b). “Layout optimization for the objects located within a rotating vessel—A three dimensional packing problem with behavioral constraints.” Comput. Oper. Res., 28(6), 521–535.
Wang, P. Y. (1983). “Two algorithms for constrained two-dimensional cutting stock problems.” Oper. Res., 31, 573–586.
Wang, X. J., and Li, D. Y. (1997). The satellite design methodology, Shanghai Scientific and Technical Publishers, Shanghai, P.R. China (in Chinese).
Wiegand, R. P., Liles, W. C., and De Jong, K. A. (2001). “An empirical analysis of collaboration methods in cooperative coevolutionary algorithms.” Proc., Genetic and Evolutionary Computation Conf. (GECCO), L. Spector, ed., Morgan Kaufmann, San Francisco, 1235–1242.
Wienke, P. B., Lucasius, C., and Kataman, G. (1992). “Multicriteria target optimization of analytical procedures using a genetic algorithm.” Anal. Chim. Acta, 265(2), 211–225.
Yin, S., and Cagan, J. (1998). “A pattern search-based algorithm for three-dimensional component layout.” Proc., DETC98, 1998 ASME Engineering Technical Conf., Atlanta.
Yin, S., and Cagan, J. (2000). “Exploring the effectiveness of various patterns in an extended pattern search layout algorithm.” Proc., 2000 Design Engineering Technical Conf., ASME, Baltimore.
Information & Authors
Information
Published In
Journal of Aerospace Engineering
Volume 22 • Issue 2 • April 2009
Pages: 101 - 111
Copyright
© 2009 ASCE.
History
Received: Aug 1, 2005
Accepted: Dec 21, 2007
Published online: Apr 1, 2009
Published in print: Apr 2009
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.