Term of Award

Summer 2018

Degree Name

Master of Science in Mathematics (M.S.)

Document Type and Release Option

Thesis (open access)

Copyright Statement / License for Reuse

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.

Department

Department of Mathematical Sciences

Committee Chair

Ionut Iacob

Committee Member 1

Goran Lesaja

Committee Member 2

Scott Kersey

Committee Member 3

Hua Wang

Committee Member 3 Email

hwang@georgiasouthern.edu

Abstract

Through-out military history, the need to safely and effectively allocate resources to various military operations was a task of extreme importance. Satisfying the needs of multiple consumers by optimally pairing with appropriate suppliers falls into the category of vehicle routing problems (VRP), which has been intensively studied over the years. In general, finding the optimal solution to VRP is known to be NP-hard. The proposed solutions rely on mathematical programming and the size of the problems that can be optimally solved is typically limited. In military settings, balancing the needs of multiple consumers with the current operational environment has always been a challenge. This balancing is equally crucial to the survivability of transporters and consumers. The main goal is finding an optimal way of ensuring required delivery while minimizing Soldiers risks. We show that under certain assumptions we can formulate this problem as a linear programming problem with specific constraints.

Research Data and Supplementary Material

No

Download

Share

COinS