Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-12T19:45:56.091Z Has data issue: false hasContentIssue false

Learning to set up numerical optimizations of engineering designs

Published online by Cambridge University Press:  01 April 1998

MARK SCHWABACHER
Affiliation:
National Institute of Standards and Technology, Building 304, Room 12, Gaithersburg, MD 20899, U.S.A.
THOMAS ELLMAN
Affiliation:
Department of Computer Science, Rutgers University, Piscataway, NJ 08855, U.S.A.
HAYM HIRSH
Affiliation:
Department of Computer Science, Rutgers University, Piscataway, NJ 08855, U.S.A.

Abstract

Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the objective function and constraint functions are continuous, smooth, and defined everywhere. Unfortunately, realistic simulators tend to violate these assumptions, making optimization unreliable. Several decisions that need to be made in setting up an optimization, such as the choice of a starting prototype and the choice of a formulation of the search space, can make a difference in the reliability of the optimization. Machine learning can improve gradient-based methods by making these choices based on the results of previous optimizations. This paper demonstrates this idea by using machine learning for four parts of the optimization setup problem: selecting a starting prototype from a database of prototypes, synthesizing a new starting prototype, predicting which design goals are achievable, and selecting a formulation of the search space. We use standard tree-induction algorithms (C4.5 and CART). We present results in two realistic engineering domains: racing yachts and supersonic aircraft. Our experimental results show that using inductive learning to make setup decisions improves both the speed and the reliability of design optimization.

Type
Research Article
Copyright
© 1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)