Optimal routing of military convoys through a road network

Thumbnail Image
Files
optimalroutingof00leed.pdf (2.66 MB)
Authors
Lee, Dong Keun
Subjects
Multicommodity
Dynamic
Transportation network
Advisors
Wood, R. Kevin
Date of Issue
1991-03
Date
March 1991
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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.
Type
Thesis
Description
URI
https://hdl.handle.net/10945/28430
Series/Report No
Department
Department of Operations Research
Organization
Naval Postgraduate School
Identifiers
NPS Report Number
Sponsors
Funder
Format
36 p.
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
Copyright is reserved by the copyright owner
Collections
Theses