Method of Path Selection in the Graph - Case Study

Abstract

This paper presents a different perspective on the Dijkstra algorithm. In this paper algorithm will be used in the further analysis to find additional paths between nodes in the maritime sector. In many cases, the best solution for a single criterion is not sufficient. I would be the search for more effective solutions of the starting point to use for subsequent analysis or decision making by the captain of the ship. Using cutting-edge thinking mechanisms, it is possible to create a decision support system based on known Dijkstraʹs algorithm. http://www.transnav.eu the International Journal on Marine Navigation and Safety of Sea Transportation Volume 8 Number 4

Multi-Objective Weather Routing of Sailboats Considering Wave Resistance

“…Other methods in this group, which can be found in [ 2,10,12,13,25], are based on dynamic programming, in which the route finding process is executed in a recursive manner. The literature also provides descriptions of deterministic graph methods, for instance those based on the modified Dijkstra algorithm [14,16] or the A* algorithm [ 15].…”

The Importance of Telematics in the Transport System

“…As a result, the shortest path algorithm is widely used routing protocols in a network, in particular the IS-IS and Open Shortest Path First. (Neumann, 2014) Short characteristic of Dijsktra algorithm (Neumann, 2016a).  The input of the algorithm consists of a weighted directed graph G and a source vertex s in G  Denote V as the set of all vertices in the graph G.  Each edge of the graph is an ordered pair of vertices (u,v)  This representing a connection from vertex u to vertex v  The set of all edges is denoted E  Weights of edges are given by a weight function w: E → [0, ∞)  Therefore w(u,v) is the cost of moving directly from vertex u to vertex v  The cost of an edge can be thought of as (a generalization of) the distance between those two vertices  The cost of a path between two vertices is the sum of costs of the edges in that path  For a given pair of vertices s and t in V, the algorithm finds the path from s to t with lowest cost (i.e.…”

Multi-Objective Weather Routing of Sailing Vessels

“…Other mostly focus on weather routing of motor-driven vessels. Only a few articles since the '60s to nowadays [9,15,3,13] present the development of research on the route planning of sailing vessels. Discretization of vessel's motion can be found in [23,24,11].…”