Language:
English
繁體中文
Help
回圖書館首頁
手機版館藏查詢
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Design Space Covering for Uncertaint...
~
Claus, Lauren Rose.
Linked to FindBook
Google Book
Amazon
博客來
Design Space Covering for Uncertainty: Exploration of a New Methodology for Decision Making in Early Stage Design.
Record Type:
Electronic resources : Monograph/item
Title/Author:
Design Space Covering for Uncertainty: Exploration of a New Methodology for Decision Making in Early Stage Design./
Author:
Claus, Lauren Rose.
Published:
Ann Arbor : ProQuest Dissertations & Theses, : 2019,
Description:
90 p.
Notes:
Source: Dissertations Abstracts International, Volume: 81-04, Section: B.
Contained By:
Dissertations Abstracts International81-04B.
Subject:
Naval engineering. -
Online resource:
https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=27536091
ISBN:
9781687927538
Design Space Covering for Uncertainty: Exploration of a New Methodology for Decision Making in Early Stage Design.
Claus, Lauren Rose.
Design Space Covering for Uncertainty: Exploration of a New Methodology for Decision Making in Early Stage Design.
- Ann Arbor : ProQuest Dissertations & Theses, 2019 - 90 p.
Source: Dissertations Abstracts International, Volume: 81-04, Section: B.
Thesis (Ph.D.)--University of Michigan, 2019.
This item must not be sold to any third party vendors.
Decisions made in early-stage design are of vital importance as they significantly impact the quality of the final design. Despite recent developments in design theory for early-stage design, designers of large complex systems still lack sufficient tools to make robust and reliable preliminary design decisions that do not have a lasting negative impact on the final design. Much of the struggle stems from uncertainty in early-stage design due to loosely defined problems and unknown parameters. Existing methods to handle this uncertainty in point-based design provide feasible, but often suboptimal, solutions that cover the range of uncertainty. Robust Optimization and Reliability Based Design Optimization are examples of point-based design methods that handle uncertainty. To maintain feasibility over the range of uncertainty, these methods accept suboptimal designs resulting in a design margin. In set-based design, design decisions are delayed preventing suboptimal final designs but at the expense of computational efficiency. This work proposes a method that evaluates a compromise between these two methodologies by evaluating the trade off of the induced regret and computational cost of keeping a larger design space. The design space covering for uncertainty (DSC-U) problem defines the metrics regret, which measures suboptimality, and space remaining, which quantifies the design space size after it is reduced. Solution methods for the DSC-U problem explore the trade space between these two metrics. When there is uncertainty in a problem, and the design space is reduced, there is the possibility that the optimal solution for the realized values of the uncertainty parameters has been eliminated; but without performing the design space reduction, it is computationally expensive to properly explore the original design space. Because of this, smart design space reductions need to be made to avoid the elimination of the optimal solution. To make smart design space reductions, designers need information regarding the design space and the trade-offs between the computational efficiency of a smaller subspace and the expected regret, or suboptimality, of the final design. As part of the DSC-U defitition, two separate spaces for the design variables and the uncertain parameters are defined. Two algorithms are presented here that solve the DSC-U problem as it is defined. A nested optimizer algorithm using a single objective optimization problem, nested in a multi-objective optimization problem is capable of finding the Pareto front in the regret-space remaining trade space for small problems. The nested optimizer algorithm is used to solve a box girder design and a cantilever tube design problems. The level set covering (LSC) algorithm solves for the Pareto front by solving the set covering problem with level sets corresponding to allowable regret levels. The LSC is used to solve a 7-variable Rosenbrock problem and a midship design problem. The presented solutions show that the DSC-U problem is a valid approach for handling uncertainty in early-stage design.
ISBN: 9781687927538Subjects--Topical Terms:
3173824
Naval engineering.
Subjects--Index Terms:
Optimization
Design Space Covering for Uncertainty: Exploration of a New Methodology for Decision Making in Early Stage Design.
LDR
:04324nmm a2200349 4500
001
2280193
005
20210830065509.5
008
220723s2019 ||||||||||||||||| ||eng d
020
$a
9781687927538
035
$a
(MiAaPQ)AAI27536091
035
$a
(MiAaPQ)umichrackham002182
035
$a
AAI27536091
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Claus, Lauren Rose.
$3
3558699
245
1 0
$a
Design Space Covering for Uncertainty: Exploration of a New Methodology for Decision Making in Early Stage Design.
260
1
$a
Ann Arbor :
$b
ProQuest Dissertations & Theses,
$c
2019
300
$a
90 p.
500
$a
Source: Dissertations Abstracts International, Volume: 81-04, Section: B.
500
$a
Advisor: Collette, Matthew David.
502
$a
Thesis (Ph.D.)--University of Michigan, 2019.
506
$a
This item must not be sold to any third party vendors.
506
$a
This item must not be added to any third party search indexes.
520
$a
Decisions made in early-stage design are of vital importance as they significantly impact the quality of the final design. Despite recent developments in design theory for early-stage design, designers of large complex systems still lack sufficient tools to make robust and reliable preliminary design decisions that do not have a lasting negative impact on the final design. Much of the struggle stems from uncertainty in early-stage design due to loosely defined problems and unknown parameters. Existing methods to handle this uncertainty in point-based design provide feasible, but often suboptimal, solutions that cover the range of uncertainty. Robust Optimization and Reliability Based Design Optimization are examples of point-based design methods that handle uncertainty. To maintain feasibility over the range of uncertainty, these methods accept suboptimal designs resulting in a design margin. In set-based design, design decisions are delayed preventing suboptimal final designs but at the expense of computational efficiency. This work proposes a method that evaluates a compromise between these two methodologies by evaluating the trade off of the induced regret and computational cost of keeping a larger design space. The design space covering for uncertainty (DSC-U) problem defines the metrics regret, which measures suboptimality, and space remaining, which quantifies the design space size after it is reduced. Solution methods for the DSC-U problem explore the trade space between these two metrics. When there is uncertainty in a problem, and the design space is reduced, there is the possibility that the optimal solution for the realized values of the uncertainty parameters has been eliminated; but without performing the design space reduction, it is computationally expensive to properly explore the original design space. Because of this, smart design space reductions need to be made to avoid the elimination of the optimal solution. To make smart design space reductions, designers need information regarding the design space and the trade-offs between the computational efficiency of a smaller subspace and the expected regret, or suboptimality, of the final design. As part of the DSC-U defitition, two separate spaces for the design variables and the uncertain parameters are defined. Two algorithms are presented here that solve the DSC-U problem as it is defined. A nested optimizer algorithm using a single objective optimization problem, nested in a multi-objective optimization problem is capable of finding the Pareto front in the regret-space remaining trade space for small problems. The nested optimizer algorithm is used to solve a box girder design and a cantilever tube design problems. The level set covering (LSC) algorithm solves for the Pareto front by solving the set covering problem with level sets corresponding to allowable regret levels. The LSC is used to solve a 7-variable Rosenbrock problem and a midship design problem. The presented solutions show that the DSC-U problem is a valid approach for handling uncertainty in early-stage design.
590
$a
School code: 0127.
650
4
$a
Naval engineering.
$3
3173824
653
$a
Optimization
653
$a
Early stage design
653
$a
Design methodology
690
$a
0468
710
2
$a
University of Michigan.
$b
Naval Architecture & Marine Engineering.
$3
3346711
773
0
$t
Dissertations Abstracts International
$g
81-04B.
790
$a
0127
791
$a
Ph.D.
792
$a
2019
793
$a
English
856
4 0
$u
https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=27536091
based on 0 review(s)
Location:
ALL
電子資源
Year:
Volume Number:
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
W9431926
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login