Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Finding optimal route by two-criterion Fuzzy Floyd’s algorithm—case study Serbia


Traditional optimal route selection procedures in traffic network usually take into account distance and/or travelling time between nodes. These two values are not always directly proportional, but they both influence travelling costs. Most of modern navigational systems dynamically check proposed route in certain time interval and correct it if necessary (congestion, road works, road accidents etc.). Provided route is, in most cases, compatible only with the traffic management requirements, but not necessarily with road safety conditions. In this paper we use the well-known method for finding the shortest paths between all pairs of nodes in transport network known as Floyd’s algorithm. In order to obtain the optimal solution while having two criteria simultaneously we propose integration of travelling time and a road safety parameter. Proposed methodology was tested on a real network which consists of 101 nodes in northern part of the Republic of Serbia.

This is a preview of subscription content, log in to check access.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7


  1. Chandra S (2014) Safety-based path finding in urban areas for older drivers and bicyclists. Transp Res Part C 48:143–157

  2. Chuang TN, Kung JY (2006) A new algorithm for the discrete fuzzy shortest path problem in a network. Appl Math Comput 174(1):660–668

  3. Dijkstra A (2011) En route to safer roads: how road structure and road classification can affect road safety [Ph.D. Thesis]. Available at: Accessed 23 June 2015

  4. Dijkstra A (2013) En route to safer roads: How road structure and road classification can affect road safety. Dissertation, University of Twente

  5. Dijkstra A (2013b) Assessing the safety of routes in a regional network. Transp Res Part C Emerg Technol 32:103–115

  6. Dubois DJ (1980) Fuzzy sets and systems: theory and applications. Academic, New York

  7. Ehrgott M, Wang JYT, Raith A, Houtte C (2012) A bi-objective cyclist route choice model. Transp Res Part A 46:652–663

  8. Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345

  9. Garber NJ, Haas PR, Gosse C (2010) Development of safety performance functions for two-lane roads maintained by the Virginia Department of Transportation Virginia. Transportation Research Council. www.safetyanalystorg/pdf/DevelopmentofSPFsfor2-laneroads(VA).pdf. Accessed 23 Jan 2015

  10. Hakkert AS, Gitelman V, Vis MA (2007) Road safety performance indicators: theory deliverable D3.6

  11. Henn V, Ottomanelli M (2005) Handling uncertainty on route choice models: from probabilistic to possibilistic approaches. Eur J Oper Res 175:1526–1538

  12. International Road Assessment Programme (iRAP) (2014) iRAP star rating coding manual setting the standards for the road coding process. Accessed 23 Jan 2015

  13. Kaufman A, Gupta M (1985) Introduction to fuzzy arithmetic. Van Nostrand Reinhold, New York

  14. Klein CM (1991) Fuzzy shortest paths Fuzzy sets and systems 39(1):27–41

  15. Kukić D (2014) The casualty risk quantification model. Dissertation, University of Belgrade

  16. Labi S (2006) Effects of geometric characteristics of rural two-lane roads on safety. Center for the Advancement of Transportation Safety. Accessed 5 April 2016

  17. Meenakshi AR, Kaliraja M (2012) Determination of the shortest path in interval valued fuzzy networks. Int J Math Arch 3(6):2377–2384

  18. Okada S, Gen M (1994) Fuzzy shortest path problem. Comput Ind Eng 27(1):465–468

  19. Palmer D, Ai-Uzaizi E, Campbell J, Killips S, Lawson V, Reid S, Lee J, Mason S, McLoughlin T, Noble P, Philippou P, Russell T, Sabey B (1998) Guidelines for cycle audit and cycle review. Institution of Highways and Transportation, London

  20. Pešić D (2012) Developing and improving the method for measuring the level of traffic safety at the territory. Dissertation, University of Belgrade

  21. Shukla KT (2013) Fuzzy Floyd’s algorithm to find shortest route between nodes under uncertain environment. Trans Stellar 3(5):43–54

  22. Srinivasan KK, Prakash AA, Seshadri R (2014) Finding most reliable paths on networks with correlated and shifted log-normal travel times. Transp Res Part B 66:110–128

  23. Teodorović D (2007) Transportation networks. Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade

  24. Yadav AK, Biswas BR (2009) On searching fuzzy shortest path in a network. Int J Recent Trends Eng 2(3):16–18

  25. Yannis G, Weijermans W, Gitelman V, Vis M, Chaziris A, Papadimitrou E, Azevedo Lima C (2013) Road safety performance indicators for the interurban road network. Accid Anal Prev 60:384–395

Download references

Author information

Correspondence to Miroslav Rosić.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Pešić, D., Šelmić, M., Macura, D. et al. Finding optimal route by two-criterion Fuzzy Floyd’s algorithm—case study Serbia. Oper Res Int J 20, 119–138 (2020).

Download citation


  • Road safety
  • Travelling time
  • Optimal route selection
  • Floyd’s algorithm
  • Fuzzy logic