Problems of the shortest path selection in restricted area
DOI:
https://doi.org/10.34767/SIMIS.2014.17.02Keywords:
Route, path, optimal path, resticted area, path searchAbstract
The main task of the information systems in transport is supporting the process of the movement of cargo and people from the departure point to the destination. Besides the typical ERP functions, these systems have also some tools like searching for the optimal route etc. The optimal route is when it’s total cost (considering different factors) is minimal. In this paper the results of experiments carried out at The Maritime University of Szczecin are described.
References
Pietrzykowski Z., Magaj J., „The safe ships trajectory in a restricted area”, Zeszyty Naukowe Akademii Morskiej w Szczecinie nr 39(111) 2014.
Goodwyn E.M., „A statistical study of ship domain”, Journal of Navigation 28, 1975, 328-341.
Dramski M., Mąka M., “An algorithm of solving collision problem of two objects in restricted area”, Activities of Transport Telematics, Communications in Computer and Information Science vol. 395, 2013, pp 251-257.
Dramski M., “Bidirectional search in route planning in naviagtion”, Zeszyty Naukowe Akademii Morskiej w Szczecinie nr 39(111) 2014.
Dramski M. ,”Shortest path problem in static navigation situations”, Metody Informatyki Stosowanej nr 5/ 2011
Dijkstra, E. W. (1959). "A note on two problems in connexion with graphs". Numerische Mathematik 1: 269– 271
