Determining Optimum Ship Routes
Abstract
A method is given for determining optimum ship routes on a digital computer. A ship is assumed to be in a fallout field whose intensity is a known function f(x, y, t) of position and time. A typical problem is that of choosing a route to a point where f ≦ fm, the maximum intensity that can be tolerated indefinitely. The route is to be such as to minimize the dose z = ∫0Tfdt, the termininal time and point are not specified. The problem of sending the ship to a given point with z minimized is also discussed. These are equivalent to corresponding problems of choosing a route to minimize the probability of detection while going through a region where the probability of detection is a known function of position and time.
Description
The article of record as published may be found at https://doi.org/10.1287/ opre.10.6.799
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.Collections
Related items
Showing items related by title, author, creator and subject.
-
A proposal to apply Taguchi-Inspired Methods to the reduction of machining variance
Trietsch, Dan (Monterey, California. Naval Postgraduate School, 1992-09); NPS-AS-92-021The Probability a Machined part will be defective increases with the variance of the machined dimensions. Even for parts within tolerance, the quality decreases with the variance. By reducing the variance of these dimensions ... -
Optimal randomized surveillance patterns to detect intruders approaching a military installation
McLemore, Trevor (Monterey California. Naval Postgraduate School, 2007-06);This thesis addresses a two-person zero-sum game between an intruder and a defender of a military installation. The intruder attempts to penetrate the military installation by choosing one of its many entry points, each ... -
Investigation and implementation of an algorithm for computing optimal search paths
Caldwell, James F., Jr. (1987-09);A moving target is detected at long range with an initial position given by a probability distribution on a grid of N cells. Also located on the grid is a searcher, constrained by speed, who must find an optimal search ...