GDO Principles

You can apply goal-driven optimization to design optimization by using any of the following methods:

MOGA is better for calculating the global optima, while NLPQL and MISQP are gradient-based algorithms ideally suited for local optimization. So you can start with Screening or MOGA to locate the multiple tentative optima and then refine with NLPQL or MISQP to zoom in on the individual local maximum or minimum value.

The GDO framework uses a Decision Support Process (DSP) based on satisfying criteria as applied to the parameter attributes using a weighted aggregate method. In effect, the DSP can be viewed as a postprocessing action on the Pareto fronts as generated from the results of the various optimization methods.

Usually Screening is used for preliminary design, which can lead you to apply one of the other approaches for more refined optimization results. Note that running a new optimization causes a new sample set to be generated.

In either approach, the Tradeoff chart, as applied to the resulting sample set, shows the Pareto-dominant solutions. However, in MOGA, the Pareto fronts are better articulated and most of the feasible solutions lie on the first front, as opposed to the usual results of Screening, where the solutions are distributed across all the Pareto fronts. This is illustrated in the following two figures.

This first figure shows the 6,000 sample points generated by the Screening method.

This second figure shows a final sample set for the same problem after 5,400 evaluations by MOGA.

The following figure demonstrates the necessity of generating Pareto fronts. The optimal Pareto front shows two non-dominated solutions. The "first Pareto front" or "Pareto frontier" is the list of non-dominated points for the optimization.

A "dominated point" is a point that, when considered in regard to another point, is not the best solution for any of the optimization objectives. For example, if point A and point B are both defined, point B is a dominated point when point A is the better solution for all objectives.

In this example, the two axes represent two output parameters with conflicting objectives: the X axis represents Minimize P6 (WB_V), and the Y axis represents Maximize P9 (WB_BUCK). The chart shows two optimal solutions, point 1 and point 2. These solutions are "non-dominated," which means that both points are equally good in terms of Pareto optimality, but for different objectives. Point 1 is the better solution for Minimize P6 (WB_V), and point 2 is the better solution for Maximize P9 (WB_BUCK). Neither point is strictly dominated by any other point, so both are included on the first Pareto front.


Release 18.2 - © ANSYS, Inc. All rights reserved.