{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T15:57:04Z","timestamp":1784390224297,"version":"3.55.0"},"reference-count":27,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T00:00:00Z","timestamp":1571356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2019,11,22]]},"abstract":"<jats:p>Researchers have studied several different types of directed shortest path (SP) problems under fuzzy environment. However, few researchers have focused on solving this problem in an interval-valued fuzzy network. Thus, in order to light these, we investigate a generalized kind of the SP problem under interval-valued fuzzy environment namely all pairs shortest path (APSP) problem. The main contributions of the present study are fivefold: (1) In the interval-valued fuzzy network under consideration, each arc weight is represented in terms of interval-valued fuzzy number. (2) We seek the shortest weights between every pair of nodes in a given interval-valued fuzzy network based on a dynamic approach. (3) In contrast to most existing approaches, which provide the shortest path between two predetermined nodes, the proposed approach provides the interval-valued fuzzy shortest path between every pair of nodes. (4) Similarly to the competing methods in the literature, the proposed approach not only gives the interval-valued fuzzy weights of all pairs shortest path but also provides the corresponding interval-valued fuzzy APSP. (5) The efficiency of the proposed approach is illustrated through two applications of APSP problems in wireless sensor networks and robot path planning problems.<\/jats:p>","DOI":"10.3233\/jifs-190711","type":"journal-article","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T11:38:04Z","timestamp":1571830684000},"page":"6865-6877","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":13,"title":["A novel approach for solving all-pairs shortest path problem in an interval-valued fuzzy network"],"prefix":"10.1177","volume":"37","author":[{"given":"M.","family":"Enayattabr","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Babol Branch, Islamic Azad University, Babol, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Ebrahimnejad","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H.","family":"Motameni","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H.","family":"Garg","sequence":"additional","affiliation":[{"name":"School of Mathematics, Thapar Institute of Engineering and Technology (Deemed University), Patiala, Punjab, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2019,10,18]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"AhujaR.K. MagnantiT.L. and OrlinJ.B. Network Flows: Theory Algorithms and Applications Prentice-Hall Englewood Cliffs NJ 1993."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(99)00023-5"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.3182\/20090909-4-JP-2010.00092"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-0114(98)00054-2"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.05.067"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10700-005-3665-2"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2008.07.002"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2007.02.022"},{"issue":"4","key":"e_1_3_2_10_2","first-page":"285","article-title":"A shortest path problem in an urban transportation network based on driver perceived travel time","volume":"17","author":"Ramazani H.","year":"2010","unstructured":"RamazaniH., ShafahiY. and SeyedabrishamiS.E., A shortest path problem in an urban transportation network based on driver perceived travel time, Scientia Iranica, Transaction A, Civil Engineering 17(4) (2010), 285\u2013296.","journal-title":"Scientia Iranica, Transaction A, Civil Engineering"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.11.011"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.12.035"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-016-0230-4"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2011.03.040"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJADS.2015.069610"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2016.06.050"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2018007"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1002\/int.22130"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.22452\/mjcs.vol31no4.2"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-018-0083-y"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00404-X"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.12.037"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2013.05.033"},{"key":"e_1_3_2_24_2","unstructured":"SteebrinkP.A. Optimization of Transport Network John Wiley and Sons 1973."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2013.04.018"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2014.07.001"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jhazmat.2018.07.034"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.10.034"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-190711","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-190711","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-190711","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:39:24Z","timestamp":1777455564000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-190711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,18]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,11,22]]}},"alternative-id":["10.3233\/JIFS-190711"],"URL":"https:\/\/doi.org\/10.3233\/jifs-190711","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,18]]}}}