Introduction of a Tradeoff Index for Efficient Trade Space Exploration

Author(s):  
Mehmet Unal ◽  
Gordon Warn ◽  
Timothy W. Simpson

The development of many-objective evolutionary algorithms has facilitated solving complex design optimization problems, that is, optimization problems with four or more competing objectives. The outcome of many-objective optimization is often a rich set of solutions, including the non-dominated solutions, with varying degrees of tradeoff amongst the objectives, herein referred to as the trade space. As the number of objectives increases, exploring the trade space and identifying acceptable solutions becomes less straightforward. Visual analytic techniques that transform a high-dimensional trade space into two-dimensional (2D) presentations have been developed to overcome the cognitive challenges associated with exploring high-dimensional trade spaces. Existing visual analytic techniques either identify acceptable solutions using algorithms that do not allow preferences to be formed and applied iteratively, or they rely on exhaustive sets of 2D representations to identify tradeoffs from which acceptable solutions are selected. In this paper, an index is introduced to quantify tradeoffs between any two objectives and integrated into a visual analytic technique. The tradeoff index enables efficient trade space exploration by quickly pinpointing those objectives that have tradeoffs for further exploration, thus reducing the number of 2D representations that must be generated and interpreted while allowing preferences to be formed and applied when selecting a solution. Furthermore, the proposed index is scalable to any number of objectives. Finally, to illustrate the utility of the proposed tradeoff index, a visual analytic technique that is based on this index is applied to a Pareto approximate solution set from a design optimization problem with ten objectives.

Author(s):  
Dan Carlsen ◽  
Matthew Malone ◽  
Josh Kollat ◽  
Timothy W. Simpson

Trade space exploration is a promising decision-making paradigm that provides a visual and more intuitive means for formulating, adjusting, and ultimately solving design optimization problems. This is achieved by combining multi-dimensional data visualization techniques with visual steering commands to allow designers to “steer” the optimization process while searching for the best, or Pareto optimal, designs. In this paper, we compare the performance of different combinations of visual steering commands implemented by two users to a multi-objective genetic algorithm that is executed “blindly” on the same problem with no human intervention. The results indicate that the visual steering commands — regardless of the combination in which they are invoked — provide a 4x–7x increase in the number of Pareto solutions that are obtained when the human is “in-the-loop” during the optimization process. As such, this study provides the first empirical evidence of the benefits of interactive visualization-based strategies to support engineering design optimization and decision-making. Future work is also discussed.


Author(s):  
Mehmet Unal ◽  
Gordon P. Warn ◽  
Timothy W. Simpson

Complex design optimization problems typically include many conflicting objectives, and the resulting trade space is comprised of numerous design solutions. To efficiently explore a many-objective trade space, form preferences, and select a final design, one must identify and negotiate tradeoffs between multiple, often conflicting, objectives. Identifying conflicting objective pairs allows decision-makers to concentrate on these objectives when selecting preferred designs from the non-dominated solution set, i.e., the Pareto front. Techniques exist to identify and visualize tradeoffs between these conflicting objectives to support trade space exploration; however, these techniques do not quantify, or differentiate, the shape of the Pareto front, which might be useful information for a decision-maker. More specifically, designers could gain insight from the degree of diminishing returns among solutions on the Pareto front, which can be used to understand the extent of the tradeoffs in the problem. Therefore, the shape of the Pareto front could be used to prioritize exploration of conflicting objective pairs. In this paper, we introduce a novel index that quantifies the shape of the Pareto front to provide information about the degree of diminishing returns. The aim of the index is to help designers gain insight into the underlying tradeoffs in a many-objective optimization problem and support trade space exploration by prioritizing the negotiation of conflicting objectives. The proposed Pareto Shape Index is based on analytical geometry and derived from the coordinates of the Pareto solutions in the n objective trade space. The utility of the Pareto Shape Index in differentiating diminishing returns between conflicting objectives is demonstrated by application to an eight-objective benchmark optimization problem.


2020 ◽  
Vol 143 (2) ◽  
Author(s):  
Kamrul Hasan Rahi ◽  
Hemant Kumar Singh ◽  
Tapabrata Ray

Abstract Real-world design optimization problems commonly entail constraints that must be satisfied for the design to be viable. Mathematically, the constraints divide the search space into feasible (where all constraints are satisfied) and infeasible (where at least one constraint is violated) regions. The presence of multiple constraints, constricted and/or disconnected feasible regions, non-linearity and multi-modality of the underlying functions could significantly slow down the convergence of evolutionary algorithms (EA). Since each design evaluation incurs some time/computational cost, it is of significant interest to improve the rate of convergence to obtain competitive solutions with relatively fewer design evaluations. In this study, we propose to accomplish this using two mechanisms: (a) more intensified search by identifying promising regions through “bump-hunting,” and (b) use of infeasibility-driven ranking to exploit the fact that optimal solutions are likely to be located on constraint boundaries. Numerical experiments are conducted on a range of mathematical benchmarks and empirically formulated engineering problems, as well as a simulation-based wind turbine design optimization problem. The proposed approach shows up to 53.48% improvement in median objective values and up to 69.23% reduction in cost of identifying a feasible solution compared with a baseline EA.


Author(s):  
Masataka Yoshimura ◽  
Masahiko Taniguchi ◽  
Kazuhiro Izui ◽  
Shinji Nishiwaki

This paper proposes a design optimization method for machine products that is based on the decomposition of performance characteristics, or alternatively, extraction of simpler characteristics, to accommodate the specific features or difficulties of a particular design problem. The optimization problem is expressed using hierarchical constructions of the decomposed and extracted characteristics and the optimizations are sequentially repeated, starting with groups of characteristics having conflicting characteristics at the lowest hierarchical level and proceeding to higher levels. The proposed method not only effectively enables achieving optimum design solutions, but also facilitates deeper insight into the design optimization results, and aids obtaining ideas for breakthroughs in the optimum solutions. An applied example is given to demonstrate the effectiveness of the proposed method.


Author(s):  
Moncef Hammadi ◽  
Amir Guizani ◽  
Jean-Yves Choley ◽  
Andreas Kellner ◽  
Peter Hehenberger

A novel approach for partitioning and coordinating the collaborative design optimization of complex systems is described. A partitioning metric has been formulated to select the best partitioning solutions among the total possibilities of dividing the complex design optimization problem. Then, an agent-supported approach is used for the coordination of the collaborative design optimization. The approach has been applied to the case of a preliminary design of an electric vehicle, to demonstrate how various agents can effectively communicate with each other to provide support to the collaborative design optimization of complex systems.


1990 ◽  
Vol 112 (4) ◽  
pp. 563-568 ◽  
Author(s):  
S. Azarm ◽  
W.-C. Li

The objective of this paper is twofold. First, an optimality test is presented to show that the optimality conditions for a separable two-level design optimization problem before and after its decomposition are the same. Second, based on identification of active constraints and exploitation of problem structure, a simple approach for calculating the gradient of a “second-level” problem is presented. This gradient is an important piece of information which is needed for solution of two-level design optimization problems. Three examples are given to demonstrate applications of the approach.


Author(s):  
Jianqiang Zhao ◽  
◽  
Kao Ge ◽  
Kangyao Xu

A heuristic algorithm named the leader of dolphin herd algorithm (LDHA) is proposed in this paper to solve an optimization problem whose dimensionality is not high, with dolphins that imitate predatory behavior. LDHA is based on a leadership strategy. Using the leadership strategy as reference, we have designed the proposed algorithm by simulating the preying actions of dolphin herds. Several intelligent behaviors, such as “producing leaders,” “group gathering,” “information sharing,” and “rounding up prey,” are abstracted by LDHA. The proposed algorithm is tested on 15 typical complex function optimization problems. The testing results reveal that compared with the particle swarm optimization and the genetic algorithms, LDHA has relatively high optimization accuracy and capability for complex functions. Further, it is almost unaffected by the inimicality, multimodality, or dimensions of functions in the function optimization section, which implies better convergence. In addition, ultra-high-dimensional function optimization capabilities of this algorithm were tested using the IEEE CEC 2013 global optimization benchmark. Unfortunately, the proposed optimization algorithm has a limitation in that it is not suitable for ultra-high-dimensional functions.


Author(s):  
Jiantao Liu ◽  
Hae Chang Gea ◽  
Ping An Du

Robust structural design optimization with non-probabilistic uncertainties is often formulated as a two-level optimization problem. The top level optimization problem is simply to minimize a specified objective function while the optimized solution at the second level solution is within bounds. The second level optimization problem is to find the worst case design under non-probabilistic uncertainty. Although the second level optimization problem is a non-convex problem, the global optimal solution must be assured in order to guarantee the solution robustness at the first level. In this paper, a new approach is proposed to solve the robust structural optimization problems with non-probabilistic uncertainties. The WCDO problems at the second level are solved directly by the monotonocity analysis and the global optimality is assured. Then, the robust structural optimization problem is reduced to a single level problem and can be easily solved by any gradient based method. To illustrate the proposed approach, truss examples with non-probabilistic uncertainties on stiffness and loading are presented.


Sign in / Sign up

Export Citation Format

Share Document