Optimal routing of military convoys through a road network
Lee, Dong Keun
Wood, R. Kevin
MetadataShow full item record
To wage a successful campaign, military units and materiel must be in position by the designated time. This thesis models the problem of moving military units and materiel in convoys through a road network as mathematical programming models. In particular, two models, linear and integer, are investigates. both models belong to the class of multicommodity, dynamic transshipment network problems. Based on prototypic GAMS implementations, they provide essentially the same answer. However, the linear model is easier to construct, takes less time to solve and allows for more flexible convoy routing.
Approved for public release; distribution is unlimited