Frank D. Faulkner

Peer Reviewed

Abstract: The paper is divided into four parts. The first treats a general numerical method for obtaining the minimum time route from one place to another wehn the speed of the ship is a known function to time and position. The second part treats various other phases of minimum time routes including the generation of isochrones which form the boundary of the region where a ship can be at any given time, rendezvous between ships, and problems wherein the speed does not change with time. The third treats minimum cost routing and optimum correction of perturbed routes. The last part is a discussion of a comparison with various other numerical routines, particularly with the method of gradients or steepest ascent. ~~wnd 1 wt 1 rcat s xwious ot,hcr I)habch of minimum tinw routw including the generation of isochronc~h \vhich form thts bountlar>- of the region \\-hcLrcx: I *hit) Van lx at aiir_ given lime, rwtl(~z\ous lwtwwi hIlip>, and problems \Acrcin 111~ clwetl dws not change with time. ‘l’hc third t rats minimum cost routing and o~~timum cwrrcct ion of Iwrturbcd routes. The last l)nrt i+ a tliwusAon of a coml)arison with \-arious othw nurncri~al routines, particularly \rith the mothotl of gradients or steepest :iwo11
Published in: NAVIGATION: Journal of the Institute of Navigation, Volume 10, Number 4
Pages: 351 - 367
Cite this article: Faulkner, Frank D., "NUMERICAL METHODS FOR DETERMINING OPTIMUM SHIP ROUTES", NAVIGATION: Journal of The Institute of Navigation, Vol. 10, No. 4, Winter 1963-1964, pp. 351-367.
Full Paper: ION Members/Non-Members: 1 Download Credit
Sign In