|Student Name:||2d Lt Emily K. Power|
|Thesis:||A Heuristic Approach to the Theater Distribution Problem|
|Location:||ENS Conference Room|
|Date & Time:||02/27/2014 at 0900|
|Abstract:|| Analysts at United States Transportation Command (USTRANSCOM) are tasked with providing vehicle mixtures that will support the distribution of requirements as provided in the form of Time Phased Force Deployment Data (TPFDD). An integer programming model exists to search for optimal solutions to these problems, but it is fairly time consuming, and produces only one of potentially several good quality solutions. This research constructs a number of heuristic approaches to solving the Theater Distribution Problem (TDP). Two distinct shipping methods are examined and applied through both constructive and probabilistic vehicle assignment processes. Multistart metaheuristic approaches are designed and used in conjnction with the constructive and probabilistic approaches. Random TPFDDs of size 20, 100 and 1000 are tested, and solutions are compared to those obtained by the optimal integer programming approach. The heuristic models implemented in this research develop feasible solutions to the notional TPFDDs in less time than the integer program. They can very quickly identify a number of good quality solutions to the same problem.