Date of Award

8-2023

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

Mathematical Sciences

Committee Chair/Advisor

Dr. Yongjia Song

Committee Member

Dr. Wayne Goddard

Committee Member

Dr. Matthew Saltzman

Abstract

Today's military logistics officers face a difficult challenge, generating route plans for mass deployments within contested environments. The current method of generating route plans is inefficient and does not assess the vulnerability within supply networks and chains. There are few models within the current literature that provide risk-averse solutions for multi-commodity flow models. In this thesis, we discuss two models that have the potential to aid military planners in creating route plans that account for risk and uncertainty. The first model we introduce is a continuous time model with chance constraints. The second model is a two-stage discrete time model with random attack scenarios. Both models demonstrate an ability to yield optimal route plans that are resilient in a contested environment.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.