An algorithm for generating ship schedules for a crisis deployment problem
MetadataShow full item record
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.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Aviles, Steven M. (Monterey, California. Naval Postgraduate School, 1995-09);The United States military strategy is currently focusing on Major Regional Conflicts (MRCs), rather than on a single, major war. The Plural NRC model, PaMM, is an integer programming model and solution procedure that ...
Lima, Newton Rodrigues (1988-09);This study is concerned with the problem of constructing an optimal military deployment plan for sealift assets during a period of conflict. The deployment problem is formulated as a set-partitioning optimization problem ...
Ward, Peter W. (Monterey, California. Naval Postgraduate School, 2008-03);The U.S. Navy recently designated Humanitarian Assistance (HA) and Disaster Relief (DR) as core capabilities, recognizing the importance of delivering a potent strategic communications message directly to foreign ...