skip to main content

Explore Research Products in the NSF-PAR

This content will become publicly available on December 1, 2024

Title: Identifying and Leveraging Promising Design Heuristics for Multi-Objective Combinatorial Design Optimization
Abstract

Design heuristics are traditionally used as qualitative principles to guide the design process, but they have also been used to improve the efficiency of design optimization. Using design heuristics as soft constraints or search operators has been shown for some problems to reduce the number of function evaluations needed to achieve a certain level of convergence. However, in other cases, enforcing heuristics can reduce diversity and slow down convergence. This paper studies the question of when and how a given set of design heuristics represented in different forms (soft constraints, repair operators, and biased sampling) can be utilized in an automated way to improve efficiency for a given design problem. An approach is presented for identifying promising heuristics for a given problem by estimating the overall impact of a heuristic based on an exploratory screening study. Two impact indices are formulated: weighted influence index and hypervolume difference index. Using this approach, the promising heuristics for four design problems are identified and the efficacy of selectively enforcing only these promising heuristics over both enforcement of all available heuristics and not enforcing any heuristics is benchmarked. In all problems, it is found that enforcing only the promising heuristics as repair operators enables finding good designs faster than by enforcing all available heuristics or not enforcing any heuristics. Enforcing heuristics as soft constraints or biased sampling functions results in improvements in efficiency for some of the problems. Based on these results, guidelines for designers to leverage heuristics effectively in design optimization are presented.

  more » « less
Award ID(s):
1825444 1825521
NSF-PAR ID:
10466662
Author(s) / Creator(s):
; ; ; ;
Publisher / Repository:
ASME
Date Published:
Journal Name:
Journal of Mechanical Design
Volume:
145
Issue:
12
ISSN:
1050-0472
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ( , IDETC/CIE2021)
    null (Ed.)
    Design optimization of metamaterials and other complex systems often relies on the use of computationally expensive models. This makes it challenging to use global multi-objective optimization approaches that require many function evaluations. Engineers often have heuristics or rules of thumb with potential to drastically reduce the number of function evaluations needed to achieve good convergence. Recent research has demonstrated that these design heuristics can be used explicitly in design optimization, indeed leading to accelerated convergence. However, these approaches have only been demonstrated on specific problems, the performance of different methods was diverse, and despite all heuristics being correct'', some heuristics were found to perform much better than others for various problems. In this paper, we describe a case study in design heuristics for a simple class of 2D constrained multiobjective optimization problems involving lattice-based metamaterial design. Design heuristics are strategically incorporated into the design search and the heuristics-enabled optimization framework is compared with the standard optimization framework not using the heuristics. Results indicate that leveraging design heuristics for design optimization can help in reaching the optimal designs faster. We also identify some guidelines to help designers choose design heuristics and methods to incorporate them for a given problem at hand. 
    more » « less
  2. ; ; ; ( , IDETC/CIE2021)
    null (Ed.)
    Design optimization of metamaterials and other complex systems often relies on the use of computationally expensive models. This makes it challenging to use global multi-objective optimization approaches that require many function evaluations. Engineers often have heuristics or rules of thumb with potential to drastically reduce the number of function evaluations needed to achieve good convergence. Recent research has demonstrated that these design heuristics can be used explicitly in design optimization, indeed leading to accelerated convergence. However, these approaches have only been demonstrated on specific problems, the performance of different methods was diverse, and despite all heuristics being ``correct'', some heuristics were found to perform much better than others for various problems. In this paper, we describe a case study in design heuristics for a simple class of 2D constrained multiobjective optimization problems involving lattice-based metamaterial design. Design heuristics are strategically incorporated into the design search and the heuristics-enabled optimization framework is compared with the standard optimization framework not using the heuristics. Results indicate that leveraging design heuristics for design optimization can help in reaching the optimal designs faster. We also identify some guidelines to help designers choose design heuristics and methods to incorporate them for a given problem at hand. 
    more » « less
  3. ; ; ( , Inverse Problems)
    Abstract

    Controlling the deformation of a soft body has potential applications in fields requiring precise control over the shape of the body. Areas such as medical robotics can use the shape control of soft robots to repair aneurysms in humans, deliver medicines within the body, among other applications. However, given known external loading, it is usually not possible to deform a soft body into arbitrary shapes if it is fabricated using only a single material. In this work, we propose a new physics-based method for the computational design of soft hyperelastic bodies to address this problem. The method takes as input an undeformed shape of a body, a specified external load, and a user desired final shape. It then solves an inverse problem in design using nonlinear optimization subject to physics constraints. The nonlinear program is solved using a gradient-based interior-point method. Analytical gradients are computed for efficiency. The method outputs fields of material properties which can be used to fabricate a soft body. A body fabricated to match this material field is expected to deform into a user-desired shape, given the same external loading input. Two regularizers are used to ascribea prioricharacteristics of smoothness and contrast, respectively, to the spatial distribution of material fields. The performance of the method is tested on three example cases in silico.

     
    more » « less
  4. ; ; ; ; ( , Structural and Multidisciplinary Optimization)
    Abstract

    To solve complex real-world problems, heuristics and concept-based approaches can be used to incorporate information into the problem. In this study, a concept-based approach called variable functioning (Fx) is introduced to reduce the optimization variables and narrow down the search space. In this method, the relationships among one or more subsets of variables are defined with functions using information prior to optimization; thus, the function variables are optimized instead of modifying the variables in the search process. By using the problem structure analysis technique and engineering expert knowledge, theFxmethod is used to enhance the steel frame design optimization process as a complex real-world problem. Herein, the proposed approach was coupled with particle swarm optimization and differential evolution algorithms then applied for three case studies. The algorithms are applied to optimize the case studies by considering the relationships among column cross-section areas. The results show thatFxcan significantly improve both the convergence rate and the final design of a frame structure, even if it is only used for seeding.

     
    more » « less
  5. ; ( , Information and Inference: A Journal of the IMA)
    Abstract

    Iterative thresholding algorithms seek to optimize a differentiable objective function over a sparsity or rank constraint by alternating between gradient steps that reduce the objective and thresholding steps that enforce the constraint. This work examines the choice of the thresholding operator and asks whether it is possible to achieve stronger guarantees than what is possible with hard thresholding. We develop the notion of relative concavity of a thresholding operator, a quantity that characterizes the worst-case convergence performance of any thresholding operator on the target optimization problem. Surprisingly, we find that commonly used thresholding operators, such as hard thresholding and soft thresholding, are suboptimal in terms of worst-case convergence guarantees. Instead, a general class of thresholding operators, lying between hard thresholding and soft thresholding, is shown to be optimal with the strongest possible convergence guarantee among all thresholding operators. Examples of this general class includes $\ell _q$ thresholding with appropriate choices of $q$ and a newly defined reciprocal thresholding operator. We also investigate the implications of the improved optimization guarantee in the statistical setting of sparse linear regression and show that this new class of thresholding operators attain the optimal rate for computationally efficient estimators, matching the Lasso.

     
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email