Resource allocation optimization problems in the public sector

Thumbnail Image
Leonard, Taylor Joseph
Nemhauser, George L.
Erera, Alan L.
Savelsbergh, Martin W. P.
Goldsman, David
Weir, Jeffery D.
Armacost, Andrew P.
Associated Organization(s)
Supplementary to
This dissertation consists of three distinct, although conceptually related, public sector topics: the Transportation Security Agency (TSA), U.S. Customs and Border Patrol (CBP), and the Georgia Trauma Care Network Commission (GTCNC). The topics are unified in their mathematical modeling and mixed-integer programming solution strategies. In Chapter 2, we discuss strategies for solving large-scale integer programs to include column generation and the known heuristic of particle swarm optimization (PSO). In order to solve problems with an exponential number of decision variables, we employ Dantzig-Wolfe decomposition to take advantage of the special subproblem structures encountered in resource allocation problems. In each of the resource allocation problems presented, we concentrate on selecting an optimal portfolio of improvement measures. In most cases, the number of potential portfolios of investment is too large to be expressed explicitly or stored on a computer. We use column generation to effectively solve these problems to optimality, but are hindered by the solution time and large CPU requirement. We explore utilizing multi-swarm particle swarm optimization to solve the decomposition heuristically. We also explore integrating multi-swarm PSO into the column generation framework to solve the pricing problem for entering columns of negative reduced cost. In Chapter 3, we present a TSA problem to allocate security measures across all federally funded airports nationwide. This project establishes a quantitative construct for enterprise risk assessment and optimal resource allocation to achieve the best aviation security. We first analyze and model the various aviation transportation risks and establish their interdependencies. The mixed-integer program determines how best to invest any additional security measures for the best overall risk protection and return on investment. Our analysis involves cascading and inter-dependency modeling of the multi-tier risk taxonomy and overlaying security measurements. The model selects optimal security measure allocations for each airport with the objectives to minimize the probability of false clears, maximize the probability of threat detection, and maximize the risk posture (ability to mitigate risks) in aviation security. The risk assessment and optimal resource allocation construct are generalizable and are applied to the CBP problem. In Chapter 4, we optimize security measure investments to achieve the most cost-effective deterrence and detection capabilities for the CBP. A large-scale resource allocation integer program was successfully modeled that rapidly returns good Pareto optimal results. The model incorporates the utility of each measure, the probability of success, along with multiple objectives. To the best of our knowledge, our work presents the first mathematical model that optimizes security strategies for the CBP and is the first to introduce a utility factor to emphasize deterrence and detection impact. The model accommodates different resources, constraints, and various types of objectives. In Chapter 5, we analyze the emergency trauma network problem first by simulation. The simulation offers a framework of resource allocation for trauma systems and possible ways to evaluate the impact of the investments on the overall performance of the trauma system. The simulation works as an effective proof of concept to demonstrate that improvements to patient well-being can be measured and that alternative solutions can be analyzed. We then explore three different formulations to model the Emergency Trauma Network as a mixed-integer programming model. The first model is a Multi-Region, Multi-Depot, Multi-Trip Vehicle Routing Problem with Time Windows. This is a known expansion of the vehicle routing problem that has been extended to model the Georgia trauma network. We then adapt an Ambulance Routing Problem (ARP) to the previously mentioned VRP. There are no known ARPs of this magnitude/extension of a VRP. One of the primary differences is many ARPs are constructed for disaster scenarios versus day-to-day emergency trauma operations. The new ARP also implements more constraints based on trauma level limitations for patients and hospitals. Lastly, the Resource Allocation ARP is constructed to reflect the investment decisions presented in the simulation.
Date Issued
Resource Type
Resource Subtype
Rights Statement
Rights URI