東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Computational Optimization of Networ...

Chen, Jun.

Linked to FindBook

Google Book

Amazon

博客來

Computational Optimization of Networks of Dynamical Systems Under Uncertainties: Application to the Air Transportation System.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Computational Optimization of Networks of Dynamical Systems Under Uncertainties: Application to the Air Transportation System./
Author:	Chen, Jun.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
Description:	131 p.
Notes:	Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
Contained By:	Dissertation Abstracts International79-10B(E).
Subject:	Aerospace engineering. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10786121
ISBN:	9780438017498

Computational Optimization of Networks of Dynamical Systems Under Uncertainties: Application to the Air Transportation System.
Chen, Jun.

Computational Optimization of Networks of Dynamical Systems Under Uncertainties: Application to the Air Transportation System. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 131 p.

Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.

Thesis (Ph.D.)--Purdue University, 2018.

To efficiently balance traffic demand and capacity, optimization of air traffic management relies on accurate predictions of future capacities, which are inherently uncertain due to weather forecast. This dissertation presents a novel computational efficient approach to address the uncertainties in air traffic system by using chance constrained optimization model.

ISBN: 9780438017498Subjects--Topical Terms:

1002622
Aerospace engineering.

Computational Optimization of Networks of Dynamical Systems Under Uncertainties: Application to the Air Transportation System.
LDR:03541nmm a2200325 4500 001 2201040
005 20190329144318.5
008 201008s2018 ||||||||||||||||| ||eng d
020 $a 9780438017498
035 $a (MiAaPQ)AAI10786121
035 $a (MiAaPQ)purdue:22426
035 $a AAI10786121
040 $a MiAaPQ $c MiAaPQ
100 1 $a Chen, Jun. $3 1001539
245 1 0 $a Computational Optimization of Networks of Dynamical Systems Under Uncertainties: Application to the Air Transportation System.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 131 p.
500 $a Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
500 $a Adviser: Dengfeng Sun.
502 $a Thesis (Ph.D.)--Purdue University, 2018.
520 $a To efficiently balance traffic demand and capacity, optimization of air traffic management relies on accurate predictions of future capacities, which are inherently uncertain due to weather forecast. This dissertation presents a novel computational efficient approach to address the uncertainties in air traffic system by using chance constrained optimization model.
520 $a First, a chance constrained model for a single airport ground holding problem is proposed with the concept of service level, which provides a event-oriented performance criterion for uncertainty. With the validated advantage on robust optimal planning under uncertainty, the chance constrained model is developed for joint planning for multiple related airports. The probabilistic capacity constraints of airspace resources provide a quantized way to balance the solution's robustness and potential cost, which is well validated against the classic stochastic scenario tree-based method.
520 $a Following the similar idea, the chance constrained model is extended to formulate a traffic flow management problem under probabilistic sector capacities, which is derived from a previous deterministic linear model. The nonlinearity from the chance constraint makes this problem difficult to solve, especially for a large scale case. To address the computational efficiency problem, a novel convex approximation based approach is proposed based on the numerical properties of the Bernstein polynomial. By effectively controlling the approximation error for both the function value and gradient, a first-order algorithm can be adopted to obtain a satisfactory solution which is expected to be optimal. The convex approximation approach is evaluated to be reliable by comparing with a brute-force method.
520 $a Finally, the specially designed architecture of the convex approximation provides massive independent internal approximation processes, which makes parallel computing to be suitable. A distributed computing framework is designed based on Spark, a big data cluster computing system, to further improve the computational efficiency. By taking the advantage of Spark, the distributed framework enables concurrent executions for the convex approximation processes. Evolved from a basic cloud computing package, Hadoop MapReduce, Spark provides advanced features on in-memory computing and dynamical task allocation. Performed on a small cluster of six workstations, these features are well demonstrated by comparing with MapReduce in solving the chance constrained model.
590 $a School code: 0183.
650 4 $a Aerospace engineering. $3 1002622
690 $a 0538
710 2 $a Purdue University. $b Aeronautics and Astronautics. $3 1035670
773 0 $t Dissertation Abstracts International $g 79-10B(E).
790 $a 0183
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10786121