This work presents a methodology for optimizing multiple system level assembly characteristics of complex mechanical assemblies by placement of their components. It addresses any component shape (including nonconvex, hollow, sharp edges) connected together by functional constraints. This method presents the designer with multiple solutions to the engineering configuration design problem (ECDP) using a Pareto Genetic Algorithm working on a population of sets instead of a population of individual points and thus results in a more informed a posteriori decision on the tradeoff issues between the various objectives. This paper addresses the definition of the assembly components and their relationships (ECDP), the definition of the configuration design optimization method (CDOM), and shows the application of the CDOM to one academic and two engineering test cases.

Issue Section:
Technical Papers
Keywords:
genetic algorithms, CAD, design engineering, mechanical engineering computing, Configuration, Optimization, Pareto Genetic Algorithms, Packing, Multi-Objective, Design, Layout
Topics:
Design, Genetic algorithms, Optimization, Engines, Shapes, Maintainability
1.
Lewis
,
H. R.
, and
Papadimitriou
,
C. H.
, 1978, “The Efficiency of Algorithms,” Sci. Am., Jan., pp. 96–109.
2.
Corcoran, A. L., and Wainwright, R. L., 1992, “A Genetic Algorithm for Packing in Three Dimensions,” SAC’92 Proceedings of the 1992 ACM/SIGAPP Symposium, Kansas City, ACM Press, NY.
3.
Wodziak, J. R., 1994, “Optimal Packing Utilizing Genetic Algorithms,” MS thesis, Mechanical Engineering, Clemson University, Clemson, SC.
4.
Grignon, P. M., Wodziak, J. R., and Fadel, G. M., 1996, “Bi-Objective Optimization of Components Packing Using a Genetic Algorithm,” Multidisciplinary Analysis and Optimization, AIAA.
5.
Szykman
,
S.
, and
Cagan
,
J.
,
1995
, “
A Simulated Annealing Approach to Three-Dimensional Component Packing
,”
ASME J. Mech. Des.
,
117
(
2A
), pp.
308
–
314
.
6.
Szykman
,
S.
, and
Cagan
,
J.
,
1996
, “
Constrained Three Dimensional Component Layout Using Simulated Annealing
,”
ASME J. Mech. Des.
,
119
(
1
), pp.
28
–
35
.
7.
Hart, W. E., 1994, “Adaptive Global Optimization with Local Search,” PhD thesis, University of California, San Diego.
8.
Yin, S., and Cagan, J., 1998, “A Pattern Search-Based Algorithm for Three-Dimensional Component Layout,” Proceedings of DETC98, 1998 ASME Engineering Technical Conferences, Sept. 13–16, Atlanta, GA.
9.
Moscato, P., 1989, “On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Toward Memetic Algorithms,” Ph.D. thesis, CalTech, Pasadena, CA.
10.
Sachdev, S., Paredis, C. J. J., Gupta, S. K., and Talukdar, S. N., 1998, “3D Spatial Layouts Using A-Teams,” Proceedings of ASME 24th Design Automation Conference, DETC98/DAC-5628.
11.
Kim
,
J. J.
, and
Gossard
,
D. C.
,
1991
, “
Reasoning on the Location of Components for Assembly Packaging
,”
ASME J. Mech. Des.
,
113
, pp.
402
–
407
.
12.
Lomangino, P. F., 1994, “Grammar and Optimization-Based Mechanical Packaging,” PhD. thesis, Georgia Institute of Technology, Atlanta.
13.
Schaffer, J. D., and Grefenstette, J. J., 1985, “Multiobjective Learning via GA,” Proc. 9th Int. J. Conf. Artif. Intel., pp. 593–595.
14.
Venugopal
,
V.
, and
Narendran
,
T. T.
,
1992
, “
A Genetic Algorithm Approach to the Machine-Component Grouping Problem With Multiple Objectives
,”
Computers and Industrial Engineering
,
22
(
4
), pp.
469
–
480
.
15.
Grignon, P. M., and Fadel, G., 1997, “Quality Criteria Measures for Multi Objective Solutions Obtained With a Genetic Algorithm,” AIAA SDM Conference, Orlando.
16.
Fonseca, C. M., and Fleming, J., 1993, “Genetic Algorithms for Multi Objective Optimization, Formulation, Discussion and Generalization,” Proceedings of the Fifth International Conference on Genetic Algorithms, Urbana Champaign, IL, Morgan Kaufman, San Mateo, CA.
17.
Fonseca
,
C. M.
, and
Fleming
,
J.
,
1995
, “
An Overview of Evolutionary Algorithms in Multi-Objective Optimization
,”
Evol. Comput.
,
3
(
1
), pp.
1
–
16
.
18.
Fonseca
,
C. M.
, and
Fleming
,
J.
,
1998
, “
Multi-Objective Optimization and Multiple Constraints Handling With Evolutionary Algorithms. Part I. A Unified Formulation
,”
IEEE Trans. Syst. Man Cybern., Part A
,
28
(
1
), pp.
26
–
37
.
19.
Coello, C. A. C., van Vedhuizen D. A., and Lamont G. B., 2002, Evolutionary Algorithms for Solving Multi-Objective Problems, Kluwer, New York.
20.
Sobol, I. M., 1990, “A Global Search for Multicriteria Problems,” 9th International Conference on Multiple Criteria Decision Making, Washington.
21.
Sobol
,
I. M.
,
1967
, “
On the Distribution of Points in a Cube and the Approximate Evaluation of Integrals
,”
USSR Comput. Math. Math. Phys.
,
7
, pp.
86
–
112
.
22.
O’Rourke, J., 1993, Computational Geometry in C. Cambridge, Cambridge University Press.
23.
Stewart
,
I.
, 1993, “Packing Problems in a Sport-Gear Shipping Room,” Sci. Am., (142).
24.
Grignon P. M., and Fadel, G. M., 1999, “Multi-objective Optimization by Iterative Genetic Algorithm,” ASME DETC-DAC-Las Vegas, NV, Paper No DETC-99/DAC-8576.
25.
Grignon, P. M., 1999, “Configuration Design Optimization Method,” Ph.D. dissertation, Clemson University Mechanical Engineering Department, Clemson SC.
26.
National Research Council, 1991, Improving Engineering Design. Designing for Competitive Advantage, National Academy Press.
27.
Womack, J. P., Jones, D. T., and Roos, D., 1991, The Machine that Changed the World, Harper Perrenial.
28.
Hall, M., GaLib 2.4.1 http://lancet.mit.edu/ga/.
29.
Goldberg, D. E., 1989, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA.
30.
Chevalier, A., 1986, Guide du dessinateur industriel, Hachette.
Copyright © 2004
 by ASME
You do not currently have access to this content.