TY - JOUR
AU - Guze, S.
PY - 2018/12/28
Y2 - 2024/04/20
TI - Review of Methods and Algorithms for Modelling Transportation Networks Based on Graph Theory
JF - Scientific Journal of Gdynia Maritime University
JA - sjgmu
VL -
IS - 107
SE - Articles
DO - 10.26408/107.02
UR - https://ojs.umg.edu.pl/index.php/sjgmu/article/view/106
SP - 25-39
AB - One of the best ways of modelling a transport network is to use a graph with vertices and edges. They represent nodes and arcs of such network respectively. Graph theory gives dozens of parameters or characteristics, including a connectivity, spanning trees or the different types of domination number and problems related to it. The main aim of the paper is to show graph theory methods and algorithms helpful in modelling and optimization of a transportation network. Firstly, the descriptions of basic notations in graph theory are introduced. Next, the concepts of domination, bondage number, edge-subdivision and their implementations to the transportation network description and modeling are proposed. Moreover, the algorithms for finding spanning tree or maximal flow in networks are presented. Finally, the possible usage of distinguishing concepts to exemplary transportation network is shown. The conclusions and future directions of work are presented at the end of the paper.
ER -