The smart normal constraint method for directly generating a smart Pareto set

Authors:
B. J. Hancock;C. A. Mattson
Affiliations:
Department of Mechanical Engineering, Brigham Young University, Provo, USA 84602;Department of Mechanical Engineering, Brigham Young University, Provo, USA 84602
Venue:
Structural and Multidisciplinary Optimization
Year:
2013

Citing 8
Cited 0

The quickhull algorithm for convex hulls

ACM Transactions on Mathematical Software (TOMS)
Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Genetic algorithms optimization for normalized normal constraint method under Pareto construction

Advances in Engineering Software
Clustering aided approach for decision making in computationally expensive multiobjective optimization

Optimization Methods & Software - THE JOINT EUROPT-OMS CONFERENCE ON OPTIMIZATION, 4-7 JULY, 2007, PRAGUE, CZECH REPUBLIC, PART II
Multiobjective evolutionary algorithm with controllable focus on the knees of the Pareto front

IEEE Transactions on Evolutionary Computation
Searching for knee regions in multi-objective optimization using mobile reference points

Proceedings of the 2010 ACM Symposium on Applied Computing
An Evolutionary Approach to Multiobjective Clustering

IEEE Transactions on Evolutionary Computation
A modified NBI and NC method for the solution of N-multiobjective optimization problems

Structural and Multidisciplinary Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In design situations where a single solution must be selected, it is often desirable to present the designer with a smart Pareto set of solutions--a minimal set of nondominated solutions that sufficiently represents the tradeoff characteristics of the design space. These sets are generally created by finding many well-distributed solutions and then either filtering out the excess ones or searching more closely in those regions that appear to have significant tradeoff. Such methods suffer from the inherent inefficiency of creating numerous solutions that will never be presented to the designer. This paper introduces the Smart Normal Constraint (SNC) method--a Pareto set generation method capable of directly generating a smart Pareto set. Direct generation is achieved by iteratively updating an approximation of the design space geometry and searching only in those regions capable of yielding new smart Pareto solutions. This process is made possible through the use of a new, computationally benign calculation for identifying regions of high tradeoff in a design space. Examples are provided that show the SNC method performing significantly more efficiently than the predominant existing method for generating smart Pareto sets.