54
Montes (2005) provides a detailed documentation
of Optimum Track Ship Routing (OTSR), an
automation of the weather ship routing service
providedbytheUSnavy.Therouteisretrievedbya
binary heap version of Dijkstra’s algorithm. The
system employs model fields with ½ degree spatial
resolution for both wind
and waves in the Western
Pacific Ocean. The safety is taken into account by
restricting navigation to grid points where
windspeedand wave height are within ship’s
predefinedlimits.
FortheDSS under developmentthefocus will be
on the Mediterranean Sea, where an operational
distribution of oceanographic fields
is already
running
7
(Pinardi & Coppini 2010) and subregional
models with high spatial temporal resolution are
under development in the framework ofIONIO and
TESSA projects. This willprovide a special focus on
Southern Italian seas, and in particular on their
coastalzone.TheprototypeDSSillustratedheretakes
into account the safety
restrictions from the most
recent technical guidelines for avoiding dangerous
situations on the ship. The prototype uses time‐
dependent environmental information for
computationoftheoptimalroutewithrespecttototal
navigation time. Route optimization with respect to
fuel consumption and other parameters is at the
planningstage.
The present paper
is organized into 4 sections,
which besides Introduction include a description of
thestructureoftheprototype(Sect.2),theapplication
oftheprototypetoseveralidealizedand yet realistic
situations(Sect.3),theconclusionsandabriefoutlook
offuturedevelopments(Sect.4).
2 PROTOTYPESTRUCTURE
In this section, the main features
of the prototype
systemapplicationaredescribed:thegridresolution,
the input fields, the ship response parametrization,
the constraints for navigational safety, and the
minimizationalgorithm.
2.1 Grid
The prototype DSS is based on a shortest path
algorithmonagraph.
Graphsaregridsforwhicheachgridpoint(“node”
or“vertex”)
isconnectedtoasubsetoftheremaining
nodes.Toeachconnection(“edge”or“link”)aweight
isassigned.Ifsuchweightdependsontheorientation
of the edge, the graph is said to be “directed”. The
objective of a shortest path algorithm is to find a
sequenceofedges
betweengivenstartandendnodes,
which lead to a minimum sum of the weights. If
chosenedgeweightisthetimeneededfornavigating
between edge nodes, then upon termination the
shortestpathalgorithmdeliverstheminimumvoyage
time.
7
http://gnoo.bo.ingv.it/myocean/
Model grid (i.e. the grid on which the meteo‐
oceanographic information is available) and graph
gridareingeneraldifferent.Sinceforthemomentwe
usesyntheticdataonly,wefindconvenienttoidentify
modelandgraphgrid.
A regular squared grid is constructed, with N
y
rows and N
x columns of nodes (see Table 1 for the
numericalvaluesoftheseandotherparameters).
In the work of Montes (2005), 8 edges and 8
directions per node are used, corresponding for the
northeasternquadrant oforiginnodeOto thenodes
marked with A and C in Figure 1.
This implies an
angularresolutionof45°.
Inourprototypeinstead,eachnodeisconnectedto
atotalof24edges,allowingfor16distinctdirections.
In Figure 1, points marked by A’, B’, C’, and D’
corresponds to the 4 possible directions in the
northeastern quadrant of origin node O.
Such an
organizationoftheedgesenablesreachinganangular
resolution
12givenby
o
6.26)2/1arctan(
12
(1)
Wedeemthatinanincreaseinangularresolution
iscomputationallymoreeffectivethananincreasein
grid resolution obtained by reduction of the
intermodal distance. Indeed, doubling the angular
resolution (
12 ~ 45°/2) increases the computational
cost by a factor of 3 (=24/8). Doubling the spatial
resolution instead would introduce a factor of 4
(=2^2).
Table1. Parameters of the spatial graph discretization and
inputfieldtimeresolutionemployedintheprototype.
_______________________________________________
Symbol NameValue Units
_______________________________________________
Nx=Ny Linearnumberofnodes 30‐
inthespatialgrid
D
x=Dy Spacingofthespatialgrid 4 Nautical
Miles(NM)
D
tTimeresolutionofinputfields 1 Hours
_______________________________________________
Figure1. Sample of the plot of graph edges (safegram). At
eachnode,theedgesaredisplayedasarrowspointingtothe
connected nodes. For clarity, the arrows do not reach the
nodetowhichtheypoint.Instead,theedgescorresponding
to all possible directions in the North‐Eastern quadrant of
the central node O are drawn as solid lines spanning the
whole internodal distance. Note that in the vicinity of the
graphborder,therearelessthan24edgespernode.