YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • AMS
    • Journal of Applied Meteorology
    • View Item
    •   YE&T Library
    • AMS
    • Journal of Applied Meteorology
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    Minimum-Time Routing as an N-Stage Decision Process

    Source: Journal of Applied Meteorology:;1972:;volume( 011 ):;issue: 003::page 429
    Author:
    Zoppoli, R.
    DOI: 10.1175/1520-0450(1972)011<0429:MTRAAS>2.0.CO;2
    Publisher: American Meteorological Society
    Abstract: In 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.
    • Download: (477.3Kb)
    • Show Full MetaData Hide Full MetaData
    • Item Order
    • Go To Publisher
    • Statistics

      Minimum-Time Routing as an N-Stage Decision Process

    URI
    https://yetl.yabesh.ir/yetl1/handle/yetl/4226656
    Collections
    • Journal of Applied Meteorology

    Show full 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
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian