Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

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

View through CrossRef
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.
Title: Identifying and Leveraging Promising Design Heuristics for Multi-Objective Combinatorial Design Optimization
Description:
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.

Related Results

Leveraging Design Heuristics for Multi-Objective Metamaterial Design Optimization
Leveraging Design Heuristics for Multi-Objective Metamaterial Design Optimization
Abstract Design optimization of metamaterials and other complex systems often relies on the use of computationally expensive models. This makes it challenging to use...
A NEW MULTI-OBJECTIVE ARITHMETIC OPTIMIZATION ALGORITHM
A NEW MULTI-OBJECTIVE ARITHMETIC OPTIMIZATION ALGORITHM
Today, as engineering problems become more complex in terms of the effective variables in these problems and the range of their changes and their multidimensionality (in terms of n...
Combinatorial Chemistry
Combinatorial Chemistry
AbstractThe article contains sections titled:1.Introduction2.Concept of Combinatorial Chemistry3.Methods and Techniques of Combinatorial Synthesis3.1.Synthetic Strategies Towards C...
Error Space Search for Combinatorial Optimization
Error Space Search for Combinatorial Optimization
<p dir="ltr">Combinatorial optimization problems are important both theoretically and for solving real-world problems. Many resolutions to combinatorial optimization problems...
Optimized metrics for orthogonal combinatorial CRISPR screens
Optimized metrics for orthogonal combinatorial CRISPR screens
CRISPR screening has become a powerful technology to identify genetic dependencies with single-gene resolution. Genomic codependencies can be extracted with CRISPR perturbation scr...
Multi-objective optimization in graphical models
Multi-objective optimization in graphical models
Many real-life optimization problems are combinatorial, i.e. they concern a choice of the best solution from a finite but exponentially large set of alternatives. Besides, the sol...
Multi-objective Optimization Model of Forest Spatial Structure Based on Dynamic Multi-Group PSO Algorithm
Multi-objective Optimization Model of Forest Spatial Structure Based on Dynamic Multi-Group PSO Algorithm
Abstract The multi-objective optimization problem, as one of the most popular hotspots in the current research, is facing both a big opportunity and a great challenge. Mult...
Pareto-Grid-Guided Large Language Models for Fast and High-Quality Heuristics Design in Multi-Objective Combinatorial Optimization
Pareto-Grid-Guided Large Language Models for Fast and High-Quality Heuristics Design in Multi-Objective Combinatorial Optimization
Multi-objective combinatorial optimization problems (MOCOP) frequently arise in practical applications that require the simultaneous optimization of conflicting objectives. Althoug...

Back to Top