A Spotlight Search Method for Multi-criteria Optimization Problems

Files
AIAA-2002-5432.pdf (453.92 KB)
Author(s)
Lewe, Jung-Ho
Advisor(s)
Editor(s)
Associated Organization(s)
Organizational Unit
Daniel Guggenheim School of Aerospace Engineering
The Daniel Guggenheim School of Aeronautics was established in 1931, with a name change in 1962 to the School of Aerospace Engineering
Organizational Unit
Organizational Unit
Series
Collections
Research Publications
Supplementary to:
Permanent Link
http://hdl.handle.net/1853/6291
Abstract
In many engineering applications including multidisciplinary optimization (MDO) problems, a decision maker often tends to evaluate and optimize multiple criteria at the same time to carry out a tradeoff study. Nevertheless, solving a multi-criteria optimization (MCO) problem, in general, is a difficult practice. Numerous methods have been proposed and applied to various applications over the past few decades. This paper introduces a new MCO method suitable for continuous, nonlinear MCO problems. The concept of the proposed method, a spotlight search method (SSM), is easily comprehendible and its implementation is simple and straightforward. Mathematical formulations show that this method can be considered as a variation of the goal attainment method (GAM). Five test problems are selected and numerical experiments are presented to demonstrate the usefulness of SSM with comparison to GAM. It is observed that SSM finds the Pareto front more efficiently for all test problems.
Sponsor
Date
2002-09
Extent
464817 bytes
1905 bytes
Resource Type
Text
Resource Subtype
Paper
Rights Statement
Rights URI