An algorithm for generating ship schedules for a crisis deployment problem
Loading...
Authors
Buvik, Svein
Subjects
Crisis Deployment
Deployment Plan
Schedule Generator
Dantzig-Wolfe Decomposition
Ship Schedule
Deployment Plan
Schedule Generator
Dantzig-Wolfe Decomposition
Ship Schedule
Advisors
Lawphongpanich, Siriphong
Date of Issue
1988-09
Date
Publisher
Language
en_US
Abstract
A deployment is the movement of armed forces from their
home bases to their strategic locations. The movement of
these forces usually involves the transportation of
military personnel as well as equipment and supplies. In a
crisis situation, it is essential that the deployment is
carried out in a expeditious manner.
This study considers the problem of constructing a
deployment plan for sealift assets which transport military
personnel, equipment, and supplies to their designated
locations in the least amount of time. In the construction
of such a plan, feasible transportation schedules for each
asset must be specified. When the number of movement
requirements is large, the problem of arranging schedules
for the assets is nontrivial. This thesis, therefore,
describes an algorithm to generate these schedules. Based
on several examples, this algorithm is shown to be
effective and can be used in conjunction with algorithms
for solving the overall deployment problem as well.
Type
Thesis
Description
Series/Report No
Department
Organization
Identifiers
NPS Report Number
Sponsors
Funding
Format
40 p.
Citation
Distribution Statement
Approved for public release; distribution is unlimited.