Georgia Southern University
Optimal Supply Delivery Under Military Specific Constraints
Abstract
dc:description.abstractThrough-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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science in Mathematics (M.S.)
- Level thesis:degree_level
- Thesis (open access)
- Discipline thesis:degree_discipline
- Department of Mathematical Sciences
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Fletcher, TaLena
- Contributors dc:contributor
-
- Goran Lesaja
- Scott Kersey
- Hua Wang
Subjects
dc:subject × 6Rights
- Licence dc:rights.license
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.georgiasouthern.edu/etd/1782