The Optimization of a Centralized Sequential Attack Problem with Operations Experience Effect

碩士 === 國防管理學院 === 國防決策科學研究所 === 90 === Abstract The current military operation and the form of battle evolve in tandem with the weapon’s innovation, which in turn is driven by the progress in technology development. The present battlefield is chaotic; especially when the two sides hit of...

Full description

Bibliographic Details
Main Author: 李仕銘
Other Authors: 張正昌
Format: Others
Language:zh-TW
Published: 2002
Online Access:http://ndltd.ncl.edu.tw/handle/47222799809672149909
id ndltd-TW-090NDMC1683005
record_format oai_dc
spelling ndltd-TW-090NDMC16830052015-10-13T10:17:27Z http://ndltd.ncl.edu.tw/handle/47222799809672149909 The Optimization of a Centralized Sequential Attack Problem with Operations Experience Effect 作戰經驗影響下集中化序列攻擊最佳化模式 李仕銘 碩士 國防管理學院 國防決策科學研究所 90 Abstract The current military operation and the form of battle evolve in tandem with the weapon’s innovation, which in turn is driven by the progress in technology development. The present battlefield is chaotic; especially when the two sides hit off, orders and information tend to be fuzzy. The conventional way of selecting a single attack target appears to be rather difficult already as it is based on the commander’s experience and judgment or the general description of reference guidelines, let alone the dilemma that would most likely occur to decision-makers when prioritizing multiple attack targets of different degrees of importance. This research takes into account the fundamental conditions for integration and effective operation of military forces and adopts centralized sequential attack strategy for the attack and advancement mode with multiple targets. Since the time it takes to obtain the anticipated result of any particular attack target is usually affected by several factors as well as precedent attack targets, measuring the time in reality turns out to be an extraordinarily difficult task. This study introduces the concepts of path effect and sequential effect, and deems combat experience as a critical factor affecting the time to obtain the anticipated result of an attack target, based on the above assumptions, the optimization model of centralized sequential attack is constructed to obtain the sequential attack path leading to the anticipated combat results within the shortest time period. Finally, this research also considers the condition of the optimization of sequential attack problem equality to Asymmetric Traveling Salesman Problem, and used evolver which is the package of Genetic Algorithm to solve this case. 張正昌 2002 學位論文 ; thesis 63 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國防管理學院 === 國防決策科學研究所 === 90 === Abstract The current military operation and the form of battle evolve in tandem with the weapon’s innovation, which in turn is driven by the progress in technology development. The present battlefield is chaotic; especially when the two sides hit off, orders and information tend to be fuzzy. The conventional way of selecting a single attack target appears to be rather difficult already as it is based on the commander’s experience and judgment or the general description of reference guidelines, let alone the dilemma that would most likely occur to decision-makers when prioritizing multiple attack targets of different degrees of importance. This research takes into account the fundamental conditions for integration and effective operation of military forces and adopts centralized sequential attack strategy for the attack and advancement mode with multiple targets. Since the time it takes to obtain the anticipated result of any particular attack target is usually affected by several factors as well as precedent attack targets, measuring the time in reality turns out to be an extraordinarily difficult task. This study introduces the concepts of path effect and sequential effect, and deems combat experience as a critical factor affecting the time to obtain the anticipated result of an attack target, based on the above assumptions, the optimization model of centralized sequential attack is constructed to obtain the sequential attack path leading to the anticipated combat results within the shortest time period. Finally, this research also considers the condition of the optimization of sequential attack problem equality to Asymmetric Traveling Salesman Problem, and used evolver which is the package of Genetic Algorithm to solve this case.
author2 張正昌
author_facet 張正昌
李仕銘
author 李仕銘
spellingShingle 李仕銘
The Optimization of a Centralized Sequential Attack Problem with Operations Experience Effect
author_sort 李仕銘
title The Optimization of a Centralized Sequential Attack Problem with Operations Experience Effect
title_short The Optimization of a Centralized Sequential Attack Problem with Operations Experience Effect
title_full The Optimization of a Centralized Sequential Attack Problem with Operations Experience Effect
title_fullStr The Optimization of a Centralized Sequential Attack Problem with Operations Experience Effect
title_full_unstemmed The Optimization of a Centralized Sequential Attack Problem with Operations Experience Effect
title_sort optimization of a centralized sequential attack problem with operations experience effect
publishDate 2002
url http://ndltd.ncl.edu.tw/handle/47222799809672149909
work_keys_str_mv AT lǐshìmíng theoptimizationofacentralizedsequentialattackproblemwithoperationsexperienceeffect
AT lǐshìmíng zuòzhànjīngyànyǐngxiǎngxiàjízhōnghuàxùliègōngjīzuìjiāhuàmóshì
AT lǐshìmíng optimizationofacentralizedsequentialattackproblemwithoperationsexperienceeffect
_version_ 1716827744182992896