Journal Article10.2514/2.7537
Interactive Multiobjective Optimization Procedure
75
TL;DR: In this article, an interactive multiobjective optimization procedure (IMOOP) that uses an aspiration-level approach to generate Pareto points is developed, which provides the designer or the decision maker with a formal means for efficient design exploration around a given pareto point.
read more
Abstract: This research focuses on multiobjective system design and optimization. The primary goal is to develop and test a mathematically rigorous and efficient interactive multiobjective optimization algorithm that takes into account the designer's preferences during the design process. In this research, an interactive multiobjective optimization procedure (IMOOP) that uses an aspiration-level approach to generate Pareto points is developed. This method provides the designer or the decision maker (DM) with a formal means for efficient design exploration around a given Pareto point. More specifically, the procedure provides the DM with the Pareto sensitivity information and the Pareto surface approximation at a given Pareto design for decision making and tradeoff analysis. The IMOOP has been successfully applied to two test problems. The first problem consists of a set of simple analytical expressions for its objective and constraints. The second problem is the design and sizing of a high-performance and low-cost 10-bar structure that has multiple objectives. The results indicate that the Pareto designs predicted by the Pareto surface approximation are reasonable and the performance of the second-order approximation is superior compared to that of the first-order approximation. Using this procedure a set of new aspirations that reflect the DM's preferences are easily and efficiently generated, and the new Pareto design corresponding to these aspirations is close to the aspirations themselves. This is important in that it builds the confidence of the DM in this interactive procedure for obtaining a satisfactory final Pareto design in a minimal number of iterations.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Computational methods in optimization considering uncertainties – An overview
TL;DR: In this article, the authors present a brief survey on some of the most relevant developments in the field of optimization under uncertainty, including reliability-based optimization, robust design optimization and model updating.
522
Computational methods in optimization considering uncertainties – An overview
Gerhart I. Schuëller,H. A. Jensen +1 more
- 15 Nov 2008
TL;DR: This article surveys recent developments in optimization under uncertainty, focusing on reliability-based optimization, robust design optimization, and model updating, highlighting the importance of uncertainty quantification and computational methods in engineering design.
508
Newton's Method for Multiobjective Optimization
TL;DR: An extension of Newton's method for unconstrained multiobjective optimization (multicriteria optimization) that is locally superlinear convergent to optimal points and uses a Kantorovich-like technique.
370
An Efficient Pareto Set Identification Approach for Multiobjective Optimization on Black-Box Functions
Songqing Shan,Gongming Wang +1 more
- 01 Jan 2004
TL;DR: A new method called the Pareto set pursuing (PSP) method is developed, which progressively provides a designer with a rich and evenly distributed set of Pare to optimal points.
Diversity Maximization Approach for Multiobjective Optimization
Michael Masin,Yossi Bukchin +1 more
TL;DR: A new method for generating the efficient frontier for multiobjective problems is developed, called the diversity maximization approach (DMA), which is capable of solving mixed-integer and combinatorial problems.
References
Genetic algorithms in search, optimization and machine learning
David E. Goldberg
- 01 Jan 1989
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
58.6K
•Book
Genetic algorithms in search, optimization, and machine learning
David E. Goldberg
- 01 Sep 1988
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
•Book
Multiple Criteria Optimization: Theory, Computation, and Application
R. S. Laundy
- 01 Aug 1989
TL;DR: Mathematical Background Topics from Linear Algebra Single Objective Linear Programming Determining all Alternative Optima Comments about Objective Row Parametric Programming Utility Functions, Nondominated Criterion Vectors and Efficient Points Point Estimate Weighted-sums Approach.
3.7K
An overview of evolutionary algorithms in multiobjective optimization
TL;DR: Current multiobjective evolutionary approaches are discussed, ranging from the conventional analytical aggregation of the different objectives into a single function to a number of population-based approaches and the more recent ranking schemes based on the definition of Pareto optimality.
Related Papers (5)
Kaisa Miettinen
- 26 Sep 2011
Vira Chankong,Yacov Y. Haimes +1 more
- 01 Jan 1983
Yoshikazu Sawaragi,Tetsuzo Tanino,Hirotaka Nakayama +2 more
- 12 Oct 1985