Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
This paper presents the possiblities of the use of the shortest path in the graph algorithms in ship’s safe route choice process in a restricted area. To create a graph, a trapezoidal mesh based on the S-57 digital map data was used. Numerical experiments were carried out and their results are discussed.
Czasopismo
Rocznik
Tom
Strony
3--7
Opis fizyczny
Bibliogr. 7 poz.
Twórcy
autor
autor
- Maritime University of Szczecin,Faculty of Navigation, Wały Chrobrego 1-2, 70-001 Szczecin, Poland, m.dramski@am.szczecin.pl
Bibliografia
- [1] D IJKSTRA E. W.: (1959) “A note on two problems in connexion with graphs”. Numerische Mathematik 1: 269–271
- [2] DORIGO M., STUTZLE T.: Ant Colony Optimi-zation, The MIT Press 2004
- [3] DRAMSKI M.: Shortest path problem in static navigational situations, 18 th International Multi-Conference ACS 2012, Międzyzdroje, Poland
- [4] van k REVELD M., de BERGH M., OVERMARS M., SCHWARZ k OPF O.: Computational geometry – algorithms and applications, Warsaw 2007, WNT (in Polish)
- [5] MĄkA M., MAGA j j .: Data extraction from an electronic S-57 standard chart for navigational decision systems, VII International Conference ExploShip 2012 (in English)
- [6] MĄkA M.: The recurent algorithm for area discretization using the trapezoidal mesh method, VII International Conference ExploShip 2012 (in English)
- [7] ŚMIERZCHALS k I R., MICHALEWICZ Z.: Modeling of ship trajectory in colision situations by an evolutionary algorithm, IEEE Transactions on Evolutionary Computation, Vol. 4, pp. 227-24
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BSL3-0026-0128