2026-09-19T16:55:01Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/408782022-01-13T07:54:48Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Cynthia Barnhart.
DeGregory, Keith W. (Keith William)
Massachusetts Institute of Technology. Operations Research Center.
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
2008-03-27T18:17:33Z
2008-03-27T18:17:33Z
2007
2007
http://hdl.handle.net/1721.1/40878
191222180
Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2007.
Includes bibliographical references (p. 137-138).
More than four years after the end of major combat operations in the 2003 Iraq War, the United States military continues to sustain casualties at rates higher than those during the ground campaign. Combat service support soldiers conducting daily convoy operations on the Iraqi road network account for a large number of these casualties. One reason for this is the threat's affinity to targeting soft, vulnerable, high-payoff targets through the use of roadside bombs, otherwise known as improvised explosive devices. This enemy tactic is characteristic of asymmetric warfare, in which a lesser opponent opposes a force far superior in numbers, equipment, and technology. In an asymmetric operating environment, threats blend in with the local populace making them hard to detect and are easily capable of multi-directional attacks; absent are the linear battlefields of past wars where logistical soldiers operated in the relative safety of the rear battlefield. This thesis explores a mathematical approach to decide how to use available resources to best protect logistical convoys. To achieve this we first model the threat using probabilistic models and identify input data requirements associated with the operating environment and other relevant factors.
(cont.) Second, we identify a set of force protection resources and model their counter-effects on the threat. Next, we develop a binary integer program to optimally allocate the force protection resources to a set of planned logistical convoys. Our model uses an algorithm that assigns resources to either fixed areas or individual convoys in a way that minimizes overall threat effects to the convoys. The algorithm provides lower-risk plans yielding a lower expected number of casualties. We propose integrating this force protection algorithm in conjunction with convoy planning software that optimally builds and routes convoys based on minimizing exposure to the threat to achieve even better plans. We test the performance of a system that accomplishes this by comparing its resulting plans to human-generated plans in a controlled experiment. Additionally, we conduct Monte Carlo simulations to statistically analyze the system's performance. We find that the system produces lower-risk plans in less time than human planners. We describe future development of this methodology to reducing soldier casualties, and a proposed approach for its integration into existing Army systems and processes.
by Keith W. DeGregory.
S.M.
139 p.
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Operations Research Center.
Optimization-based allocation of force protection resources in an asymmetric environment
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="d05d524a-3bea-498c-93a8-3f30882c83dd">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Optimization-based allocation of force protection resources in an asymmetric environment</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2007</PublicationDate>
<Authors>
<Author>
<DisplayName>DeGregory, Keith W. (Keith William)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Operations Research Center.</Keyword>
<Abstract>More than four years after the end of major combat operations in the 2003 Iraq War, the United States military continues to sustain casualties at rates higher than those during the ground campaign. Combat service support soldiers conducting daily convoy operations on the Iraqi road network account for a large number of these casualties. One reason for this is the threat's affinity to targeting soft, vulnerable, high-payoff targets through the use of roadside bombs, otherwise known as improvised explosive devices. This enemy tactic is characteristic of asymmetric warfare, in which a lesser opponent opposes a force far superior in numbers, equipment, and technology. In an asymmetric operating environment, threats blend in with the local populace making them hard to detect and are easily capable of multi-directional attacks; absent are the linear battlefields of past wars where logistical soldiers operated in the relative safety of the rear battlefield. This thesis explores a mathematical approach to decide how to use available resources to best protect logistical convoys. To achieve this we first model the threat using probabilistic models and identify input data requirements associated with the operating environment and other relevant factors.</Abstract>
<Abstract>(cont.) Second, we identify a set of force protection resources and model their counter-effects on the threat. Next, we develop a binary integer program to optimally allocate the force protection resources to a set of planned logistical convoys. Our model uses an algorithm that assigns resources to either fixed areas or individual convoys in a way that minimizes overall threat effects to the convoys. The algorithm provides lower-risk plans yielding a lower expected number of casualties. We propose integrating this force protection algorithm in conjunction with convoy planning software that optimally builds and routes convoys based on minimizing exposure to the threat to achieve even better plans. We test the performance of a system that accomplishes this by comparing its resulting plans to human-generated plans in a controlled experiment. Additionally, we conduct Monte Carlo simulations to statistically analyze the system's performance. We find that the system produces lower-risk plans in less time than human planners. We describe future development of this methodology to reducing soldier casualties, and a proposed approach for its integration into existing Army systems and processes.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>