東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Optimal Routing of Infiltration Oper...

Kim, Mingyu.

FindBook

Google Book

Amazon

博客來

Optimal Routing of Infiltration Operations.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Optimal Routing of Infiltration Operations./
作者:	Kim, Mingyu.
面頁冊數:	64 p.
附註:	Source: Masters Abstracts International, Volume: 54-06.
Contained By:	Masters Abstracts International54-06(E).
標題:	Industrial engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1594738
ISBN:	9781321921885

Optimal Routing of Infiltration Operations.
Kim, Mingyu.

Optimal Routing of Infiltration Operations. - 64 p.

Source: Masters Abstracts International, Volume: 54-06.

Thesis (M.S.)--State University of New York at Buffalo, 2015.

In most military operations, maneuvers have to be accompanied by forces and choosing the least-risk route for a mission is one of the most important factors for a successful mission. For example, naval fleets have to choose the safest route for sailing and air forces also need to plan an optimal route that avoid the enemy's radar or ground-to-air missiles' effective range.

ISBN: 9781321921885Subjects--Topical Terms:

526216
Industrial engineering.

Optimal Routing of Infiltration Operations.
LDR:02355nmm a2200325 4500 001 2115187
005 20170217105126.5
008 180830s2015 ||||||||||||||||| ||eng d
020 $a 9781321921885
035 $a (MiAaPQ)AAI1594738
035 $a AAI1594738
040 $a MiAaPQ $c MiAaPQ
100 1 $a Kim, Mingyu. $3 3276826
245 1 0 $a Optimal Routing of Infiltration Operations.
300 $a 64 p.
500 $a Source: Masters Abstracts International, Volume: 54-06.
500 $a Adviser: Rajan Batta.
502 $a Thesis (M.S.)--State University of New York at Buffalo, 2015.
520 $a In most military operations, maneuvers have to be accompanied by forces and choosing the least-risk route for a mission is one of the most important factors for a successful mission. For example, naval fleets have to choose the safest route for sailing and air forces also need to plan an optimal route that avoid the enemy's radar or ground-to-air missiles' effective range.
520 $a This research suggests the method for routing military ground operations, focused on conducting infiltration based on the Shortest-Path method. This thesis models the problem in four parts. First, estimate enemy locations by using public facility location model and military data. After that we define possible scenarios by enemy locations. Second, with these scenarios, model this operation as a shortest-path problem. The problem is constructed by each node's costs that consist of two factors: distance and detection probability. Every link between the nodes is given a cost to pass it according to the enemy's location in each scenario and many other factors. Third, compute optimal routes for each scenario then, among those routes, the final solution is selected by a robust optimization process. At last, using dissimilar paths, the effect of deception operation can be defined and analyzed.
520 $a Eventually, we can find out the optimal route and effect of deception operation. The efficiency of the methodology is tested and demonstrated by a case study, provided in this thesis.
590 $a School code: 0656.
650 4 $a Industrial engineering. $3 526216
650 4 $a Military studies. $3 2197382
650 4 $a Transportation. $3 555912
650 4 $a Systems science. $3 3168411
690 $a 0546
690 $a 0750
690 $a 0709
690 $a 0790
710 2 $a State University of New York at Buffalo. $b Industrial Engineering. $3 1020733
773 0 $t Masters Abstracts International $g 54-06(E).
790 $a 0656
791 $a M.S.
792 $a 2015
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1594738