Show simple item record

contributor authorZoppoli, R.
date accessioned2017-06-09T17:20:17Z
date available2017-06-09T17:20:17Z
date copyright1972/04/01
date issued1972
identifier issn0021-8952
identifier otherams-8343.pdf
identifier urihttp://onlinelibrary.yabesh.ir/handle/yetl/4226656
description abstractIn this paper the problem of determining minimum-time ship routes is expressed as a discrete decision process in stochastic conditions, and is solved by dynamic programming. Some models of such processes are considered. Their applicability depends on the amount of available meteorological information. The salient features of the computer programs, operating experimentally aboard a motorship in normal service, are illustrated and example trajectories are presented.
publisherAmerican Meteorological Society
titleMinimum-Time Routing as an N-Stage Decision Process
typeJournal Paper
journal volume11
journal issue3
journal titleJournal of Applied Meteorology
identifier doi10.1175/1520-0450(1972)011<0429:MTRAAS>2.0.CO;2
journal fristpage429
journal lastpage435
treeJournal of Applied Meteorology:;1972:;volume( 011 ):;issue: 003
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record