Show simple item record

dc.contributor.advisorCynthia Barnhart.en_US
dc.contributor.authorDeGregory, Keith W. (Keith William)en_US
dc.contributor.otherMassachusetts Institute of Technology. Operations Research Center.en_US
dc.date.accessioned2008-03-27T18:17:33Z
dc.date.available2008-03-27T18:17:33Z
dc.date.copyright2007en_US
dc.date.issued2007en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/40878
dc.descriptionThesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2007.en_US
dc.descriptionIncludes bibliographical references (p. 137-138).en_US
dc.description.abstractMore 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.en_US
dc.description.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.en_US
dc.description.statementofresponsibilityby Keith W. DeGregory.en_US
dc.format.extent139 p.en_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectOperations Research Center.en_US
dc.titleOptimization-based allocation of force protection resources in an asymmetric environmenten_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Center
dc.contributor.departmentSloan School of Management
dc.identifier.oclc191222180en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record