語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Robust Solutions for Geographic Reso...
~
Behroozi, Mehdi.
FindBook
Google Book
Amazon
博客來
Robust Solutions for Geographic Resource Allocation Problems.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Robust Solutions for Geographic Resource Allocation Problems./
作者:
Behroozi, Mehdi.
出版者:
Ann Arbor : ProQuest Dissertations & Theses, : 2016,
面頁冊數:
171 p.
附註:
Source: Dissertation Abstracts International, Volume: 78-04(E), Section: B.
Contained By:
Dissertation Abstracts International78-04B(E).
標題:
Industrial engineering. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10164584
ISBN:
9781369190762
Robust Solutions for Geographic Resource Allocation Problems.
Behroozi, Mehdi.
Robust Solutions for Geographic Resource Allocation Problems.
- Ann Arbor : ProQuest Dissertations & Theses, 2016 - 171 p.
Source: Dissertation Abstracts International, Volume: 78-04(E), Section: B.
Thesis (Ph.D.)--University of Minnesota, 2016.
This thesis describes different ways to use robust optimization concepts and techniques in problems that arise in geographic resource allocation. Many problems in geographic resource allocation deal with uncertainty just like many other domains. Some of them, like the k-centers problem, are naturally defined in a minimax fashion, and some others can be treated under uncertainty where we seek robust solutions. Most geographic resource allocation problems can be settled in one or more of the categories, such as location problems, segmentation (partitioning) problems, assignment problems, routing problems, and backbone network design problems . In all such problems there are parameters that can be unknown in practice. It is sensible to define an uncertainty set for the unknown parameter based on some crude knowledge about that unknown parameter and then to treat the uncertainty like some deterministic variability of the values of the parameter, followed by ultimately solving the problem as that parameter is another variable in a higher dimension.
ISBN: 9781369190762Subjects--Topical Terms:
526216
Industrial engineering.
Robust Solutions for Geographic Resource Allocation Problems.
LDR
:03211nmm a2200325 4500
001
2155282
005
20180426091042.5
008
190424s2016 ||||||||||||||||| ||eng d
020
$a
9781369190762
035
$a
(MiAaPQ)AAI10164584
035
$a
(MiAaPQ)umn:17538
035
$a
AAI10164584
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Behroozi, Mehdi.
$3
3343023
245
1 0
$a
Robust Solutions for Geographic Resource Allocation Problems.
260
1
$a
Ann Arbor :
$b
ProQuest Dissertations & Theses,
$c
2016
300
$a
171 p.
500
$a
Source: Dissertation Abstracts International, Volume: 78-04(E), Section: B.
500
$a
Adviser: John G. Carlsson.
502
$a
Thesis (Ph.D.)--University of Minnesota, 2016.
520
$a
This thesis describes different ways to use robust optimization concepts and techniques in problems that arise in geographic resource allocation. Many problems in geographic resource allocation deal with uncertainty just like many other domains. Some of them, like the k-centers problem, are naturally defined in a minimax fashion, and some others can be treated under uncertainty where we seek robust solutions. Most geographic resource allocation problems can be settled in one or more of the categories, such as location problems, segmentation (partitioning) problems, assignment problems, routing problems, and backbone network design problems . In all such problems there are parameters that can be unknown in practice. It is sensible to define an uncertainty set for the unknown parameter based on some crude knowledge about that unknown parameter and then to treat the uncertainty like some deterministic variability of the values of the parameter, followed by ultimately solving the problem as that parameter is another variable in a higher dimension.
520
$a
For such problems in geographic resource allocation, we take a robust approach to tackle the uncertainty. Depending on the problem and also geometry of the uncertainty set, the robust optimization model can be tractable or difficult to solve. We deal with both cases in this thesis where we combine elements from computational geometry, geometric probability theory, vector space optimization, and topology, to either solve the problem to optimality or develop fast algorithms to settle with an approximation solution. We also present a divide and conquer type of approach using geometric partitioning to solve robust optimization problems. In a generic robust optimization problem, if the uncertainty set is an infinite set (which is the case in most practical situations), then we will have an infinite or semi-infinite dimensional optimization problem since the model will have infinite number of constraints. We describe the drawbacks of the current approaches to solving such problems and their inability to obtain reasonable solutions for some special but common and practical cases, like clustered data, and then we show that our approach makes these problems easy to solve.
590
$a
School code: 0130.
650
4
$a
Industrial engineering.
$3
526216
650
4
$a
Operations research.
$3
547123
650
4
$a
Applied mathematics.
$3
2122814
690
$a
0546
690
$a
0796
690
$a
0364
710
2
$a
University of Minnesota.
$b
Industrial and Systems Engineering.
$3
3170834
773
0
$t
Dissertation Abstracts International
$g
78-04B(E).
790
$a
0130
791
$a
Ph.D.
792
$a
2016
793
$a
English
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10164584
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9354829
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入