Application of Floyd‘s Algorithm on Transport Network of South Bohemian Region

  • Jiri Hanzl
  • Ladislav Bartuska
  • Elena Rozhanskaya
  • Petr Prusa
Keywords: distance matrix, traffic network, transport model, Floyd algorithm, optimal route, minimal path

Abstract

The introductory part of the paper deals with the theory of searching for optimal routes in transport networks, including a description of each type of optimization tasks. The aim of the article is demonstration of Floyd algorithm application to find the minimal paths from each node to another in network graph - in our case the network represents traffic model of road network in the region of South Bohemia.

Author Biographies

Jiri Hanzl

The Institute of Technology and Business in Ceske Budejovice, Faculty of Technology, Czech Republic

Ladislav Bartuska

The Institute of Technology and Business in Ceske Budejovice, Faculty of Technology, Czech Republic

Elena Rozhanskaya

Plekhanov Russian University of Economics, Department of Foreign Economic Activity, Russia

Petr Prusa

University of Pardubice, Jan Perner Transport Faculty, Department of Transport Management, Marketing and Logistics, Czech Republic

Published
2016-04-30
How to Cite
Hanzl, J., Bartuska, L., Rozhanskaya, E., & Prusa, P. (2016). Application of Floyd‘s Algorithm on Transport Network of South Bohemian Region. Communications - Scientific Letters of the University of Zilina, 18(2), 68-71. Retrieved from http://journals.uniza.sk/index.php/communications/article/view/332
Issue
Vol 18 No 2 (2016)
Section
Articles