A large-scale machine system often has a general hierarchical structure. For hierarchical structures, optimization is difficult because many local optima almost always arise, however genetic algorithms that have a hierarchical genotype can be applied to treat such problems directly. Relations between the structural components are analyzed and this information is used to partition the hierarchical structure. Partitioning large-scale problems into sub-problems that can be solved using parallel processed GAs increases the efficiency of the optimization search. The optimization of large-scale systems then becomes possible due to information sharing of Pareto optimum solutions for the sub-problems.

1.
Sobieski, J., 1982, “A Linear Decomposition Method for Optimization Problems—Blueprint for Development,” NASA Technical Memorandum 83248.
2.
Kusiak
,
A.
, and
Wang
,
J.
,
1993
, “
Decomposition of the Design Process
,”
ASME J. Mech. Des.
,
115
, pp.
687
694
.
3.
Krishnamachari
,
R. S.
, and
Papalambros
,
P. Y.
,
1997
, “
Optimal Hierarchical Decomposition Synthesis Using Integer Programming
,”
ASME J. Mech. Des.
,
119
, pp.
440
447
.
4.
Bloebaum
,
C. L.
,
1995
, “
Coupling Strength-Based System Reduction for Complex Engineering Design
,”
Struct. Optim.
,
10
(
2
), pp.
113
121
.
5.
McCulley
,
C.
, and
Bloebaum
,
C. L.
,
1996
, “
A Genetic Tool for Optimal Design Sequencing in Complex Engineering Systems
,”
Struct. Optim.
,
12
, pp.
186
201
.
6.
Holland, J. H., 1975, Adaptation in Natural and Artificial Systems, University of Michigan Press.
7.
Goldberg, D. E., 1989, Genetic Algorithms in Search, Optimization & Machine Learning, Addison-Wesley.
8.
Yoshimura, M., and Izui, K., 1999, “Smart Optimization of Machine Systems Using Hierarchical Genotype Representations,” Proceedings of ASME Design Engineering Technical Conferences, DAC-8631, pp. 1–8.
9.
Koza, J. R., 1991, Genetic Programming, MIT Press.
10.
Pettey, C. C., and Leuze, M. R., 1989, “A Theoretical Investigation of a Parallel Genetic Algorithm,” Proceedings of 3rd International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 398–405.
11.
Muhlenbein, H., 1989, “Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization,” Proceedings of 3rd International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 398–405.
12.
Lin, S-C, Punch W. F., III, and Goodman, E. D., 1994, “Coarse-Grain Parallel Genetic Algorithms: Categorization and New Approach,” Proceedings of 6th IEEE Parallel and Distributed Processing, pp. 28–37.
13.
Malott, B., Averill, R. C., Goodman, E. D., Ding, Y., and Punch, W. F., 1996, “Use of Genetic Algorithms for Optimal Design of Laminated Composite Sandwich Panels with Bending-Twisting Coupling,” AIAA/ASME/ASCE/AHS/ASC 37th Structures, Structural Dynamics and Materials Conference.
14.
Eby, D., Averill, R. C., 1997, “An Injection Island GA for Flywheel Design Optimization,” Proceedings of EUFIT ’97—5th European Congress on Intelligent Techniques and Soft Computing, pp. 687–691.
15.
Kirschman
,
C. F.
, and
Fadel
,
G. M.
,
1998
, “
Classifying Functions for Mechanical Design
,”
ASME J. Mech. Des.
,
120
, pp.
475
482
.
16.
Schaffer, J. D., 1985, “Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms,” Proceedings of the First International Conference on Genetic Algorithms and Their Applications, Lawrence Erlbaum Associates, pp. 160–168.
17.
Tamaki, H., Mori, M., and Araki, M., 1994, “Multi-Criteria Optimization by Genetic Algorithms,” Abstracts of the 3rd Conference of the Association of Asian-Pacific Operational Research Societies within IFORS, 51.
You do not currently have access to this content.