Optimization Model for Scheduling Army Base Realignment and Closure Actions

摘要

The United States Army is reducing and reshaping its force structure to adapt tothe nation's changing defense needs and budget constraints. Along with significant personnel reductions, the Army is divesting itself of excess infrastructure through a process of Base Realignment and Closure (BRAC). A necessary step in the BRAC process is calculation of the Net Present Value (NPV) of savings associated with base realignments and closures which must be computed using the Cost of Base Realignment Actions (COBRA) model. COBRA is not an optimization model. The user must enter when specific BRAC actions will occur. This thesis develops a mixed integer linear programming model to assist The Army Basing Study (TABS), the primary analysis agency for Army BRAC issues, schedule slated BRAC actions. The model generates an optimal schedule which attains maximum potential savings within budgetary constraints. In the past, Army analysts have accomplished this scheduling within COBRA using a time consuming process with no guarantee of optimality. Using a systematic time efficient approach, the model achieved a 34% increase in savings ($223 million) over the manual schedule developed by TABS for an actual BRAC 93 scenario.