IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v20y2020i1d10.1007_s12351-017-0319-4.html
   My bibliography  Save this article

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

Author

Listed:
  • Dalibor Pešić

    (University of Belgrade)

  • Milica Šelmić

    (University of Belgrade)

  • Dragana Macura

    (University of Belgrade)

  • Miroslav Rosić

    (Road Traffic Safety Agency)

Abstract

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.

Suggested Citation

  • Dalibor Pešić & Milica Šelmić & Dragana Macura & Miroslav Rosić, 2020. "Finding optimal route by two-criterion Fuzzy Floyd’s algorithm—case study Serbia," Operational Research, Springer, vol. 20(1), pages 119-138, March.
    • Handle: RePEc:spr:operea:v:20:y:2020:i:1:d:10.1007_s12351-017-0319-4
    DOI: 10.1007/s12351-017-0319-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-017-0319-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-017-0319-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Srinivasan, Karthik K. & Prakash, A.A. & Seshadri, Ravi, 2014. "Finding most reliable paths on networks with correlated and shifted log–normal travel times," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 110-128.
    2. Ehrgott, Matthias & Wang, Judith Y.T. & Raith, Andrea & van Houtte, Chris, 2012. "A bi-objective cyclist route choice model," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(4), pages 652-663.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ospina, Juan P. & Duque, Juan C. & Botero-Fernández, Verónica & Montoya, Alejandro, 2022. "The maximal covering bicycle network design problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 159(C), pages 222-236.
    2. Duque, Daniel & Lozano, Leonardo & Medaglia, Andrés L., 2015. "An exact method for the biobjective shortest path problem for large-scale road networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 788-797.
    3. McArthur, David Philip & Hong, Jinhyun, 2019. "Visualising where commuting cyclists travel using crowdsourced data," Journal of Transport Geography, Elsevier, vol. 74(C), pages 233-241.
    4. Jurgis Zagorskas & Marija Burinskienė, 2019. "Challenges Caused by Increased Use of E-Powered Personal Mobility Vehicles in European Cities," Sustainability, MDPI, vol. 12(1), pages 1-13, December.
    5. Yang, Lin & Kwan, Mei-Po & Pan, Xiaofang & Wan, Bo & Zhou, Shunping, 2017. "Scalable space-time trajectory cube for path-finding: A study using big taxi trajectory data," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 1-27.
    6. Mishra, Sabyasachee & Khasnabis, Snehamay & Swain, Subrat, 2013. "Multi-entity perspective transportation infrastructure investment decision making," Transport Policy, Elsevier, vol. 30(C), pages 1-12.
    7. Khani, Alireza & Boyles, Stephen D., 2015. "An exact algorithm for the mean–standard deviation shortest path problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 252-266.
    8. Xu, Zhandong & Chen, Anthony & Liu, Xiaobo, 2023. "Time and toll trade-off with heterogeneous users: A continuous time surplus maximization bi-objective user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 31-58.
    9. Adrian Barchański & Renata Żochowska & Marcin Jacek Kłos, 2022. "A Method for the Identification of Critical Interstop Sections in Terms of Introducing Electric Buses in Public Transport," Energies, MDPI, vol. 15(20), pages 1-37, October.
    10. Shen, Liang & Shao, Hu & Wu, Ting & Fainman, Emily Zhu & Lam, William H.K., 2020. "Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    11. Bagloee, Saeed Asadi & Sarvi, Majid & Wallace, Mark, 2016. "Bicycle lane priority: Promoting bicycle as a green mode even in congested urban area," Transportation Research Part A: Policy and Practice, Elsevier, vol. 87(C), pages 102-121.
    12. A. Arun Prakash & Karthik K. Srinivasan, 2017. "Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation," Networks and Spatial Economics, Springer, vol. 17(3), pages 809-840, September.
    13. Seungkyu Ryu & Anthony Chen & Jacqueline Su & Xintao Liu & Jiangbo (Gabe) Yu, 2021. "Considering Space Syntax in Bicycle Traffic Assignment with One or More User Classes," Sustainability, MDPI, vol. 13(19), pages 1-15, October.
    14. Morton, Craig, 2020. "The demand for cycle sharing: Examining the links between weather conditions, air quality levels, and cycling demand for regular and casual users," Journal of Transport Geography, Elsevier, vol. 88(C).
    15. Chen, Bi Yu & Li, Qingquan & Lam, William H.K., 2016. "Finding the k reliable shortest paths under travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 189-203.
    16. Zang, Zhaoqi & Xu, Xiangdong & Yang, Chao & Chen, Anthony, 2018. "A closed-form estimation of the travel time percentile function for characterizing travel time reliability," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 228-247.
    17. Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    18. Barahimi, Amir Hossein & Eydi, Alireza & Aghaie, Abdolah, 2021. "Multi-modal urban transit network design considering reliability: multi-objective bi-level optimization," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    19. Liang Shen & Feiran Wang & Yueyuan Chen & Xinyi Lv & Zongliang Wen, 2022. "A Reliability-Based Stochastic Traffic Assignment Model for Signalized Traffic Network with Consideration of Link Travel Time Correlations," Sustainability, MDPI, vol. 14(21), pages 1-18, November.
    20. Lu, Chang & Wu, Yuehui & Yu, Shanchuan, 2022. "A Sample Average Approximation Approach for the Stochastic Dial-A-Ride Problem on a Multigraph with User Satisfaction," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1031-1044.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:operea:v:20:y:2020:i:1:d:10.1007_s12351-017-0319-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.