{"id":"https://openalex.org/W2982103310","doi":"https://doi.org/10.3233/jifs-190711","title":"A novel approach for solving all-pairs shortest path problem in an interval-valued fuzzy network","display_name":"A novel approach for solving all-pairs shortest path problem in an interval-valued fuzzy network","publication_year":2019,"publication_date":"2019-10-18","ids":{"openalex":"https://openalex.org/W2982103310","doi":"https://doi.org/10.3233/jifs-190711","mag":"2982103310"},"language":"en","primary_location":{"id":"doi:10.3233/jifs-190711","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-190711","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013750725","display_name":"Mohammad Enayattabr","orcid":null},"institutions":[{"id":"https://openalex.org/I4400573191","display_name":"Islamic Azad University, Babol","ror":"https://ror.org/00pwbq328","country_code":null,"type":"education","lineage":["https://openalex.org/I4400573191"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Enayattabr","raw_affiliation_strings":["Department of Computer Engineering, Babol Branch, Islamic Azad University, Babol, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Babol Branch, Islamic Azad University, Babol, Iran","institution_ids":["https://openalex.org/I4400573191"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089713497","display_name":"Ali Ebrahimnejad","orcid":"https://orcid.org/0000-0001-6003-6601"},"institutions":[{"id":"https://openalex.org/I4210138903","display_name":"Qaemshahr Islamic Azad University","ror":"https://ror.org/03y0dv989","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I4210138903"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"A. Ebrahimnejad","raw_affiliation_strings":["Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran","institution_ids":["https://openalex.org/I4210138903"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056652920","display_name":"Homayun Motameni","orcid":"https://orcid.org/0000-0003-2150-2811"},"institutions":[{"id":"https://openalex.org/I4210086811","display_name":"Islamic Azad University Sari Branch","ror":"https://ror.org/0032wgp28","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I4210086811"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"H. Motameni","raw_affiliation_strings":["Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran","institution_ids":["https://openalex.org/I4210086811"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054194585","display_name":"Harish Garg","orcid":"https://orcid.org/0000-0001-9099-8422"},"institutions":[{"id":"https://openalex.org/I162030827","display_name":"Thapar Institute of Engineering & Technology","ror":"https://ror.org/00wdq3744","country_code":"IN","type":"education","lineage":["https://openalex.org/I162030827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"H. Garg","raw_affiliation_strings":["School of Mathematics, Thapar Institute of Engineering and Technology (Deemed University), Patiala, Punjab, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, Thapar Institute of Engineering and Technology (Deemed University), Patiala, Punjab, India","institution_ids":["https://openalex.org/I162030827"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5089713497"],"corresponding_institution_ids":["https://openalex.org/I4210138903"],"apc_list":null,"apc_paid":null,"fwci":0.9925,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.8083038,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"37","issue":"5","first_page":"6865","last_page":"6877"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.864116907119751},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6807067394256592},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.5741602182388306},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48857221007347107},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4762026071548462},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4356595277786255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39935314655303955},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3559097945690155},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3517869710922241},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23954510688781738},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19597327709197998},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14504438638687134},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0935811698436737},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06750449538230896}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.864116907119751},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6807067394256592},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.5741602182388306},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48857221007347107},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4762026071548462},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4356595277786255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39935314655303955},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3559097945690155},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3517869710922241},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23954510688781738},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19597327709197998},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14504438638687134},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0935811698436737},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06750449538230896}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/jifs-190711","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-190711","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1694068690","https://openalex.org/W1972606965","https://openalex.org/W1977471012","https://openalex.org/W1978943789","https://openalex.org/W1980308649","https://openalex.org/W1994937951","https://openalex.org/W2015107988","https://openalex.org/W2017010781","https://openalex.org/W2040155335","https://openalex.org/W2042411814","https://openalex.org/W2068758895","https://openalex.org/W2073914408","https://openalex.org/W2079548745","https://openalex.org/W2080638416","https://openalex.org/W2083103721","https://openalex.org/W2087463697","https://openalex.org/W2089235815","https://openalex.org/W2266720707","https://openalex.org/W2301247617","https://openalex.org/W2460560651","https://openalex.org/W2783060941","https://openalex.org/W2883599811","https://openalex.org/W2898328298","https://openalex.org/W2903389907","https://openalex.org/W2955312703"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W2375775343","https://openalex.org/W1990043277","https://openalex.org/W2962525871","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2388051136","https://openalex.org/W2364137215"],"abstract_inverted_index":{"Researchers":[0],"have":[1,18],"studied":[2],"several":[3],"different":[4],"types":[5],"of":[6,40,58,79,92,133,154,170,179],"directed":[7],"shortest":[8,51,87,115,128,157],"path":[9,52,116,129,158,188],"(SP)":[10],"problems":[11,181],"under":[12,44,70],"fuzzy":[13,27,46,68,81,98,127,152,165],"environment.":[14],"However,":[15],"few":[16],"researchers":[17],"focused":[19],"on":[20,101],"solving":[21],"this":[22],"problem":[23,43],"in":[24,30,77,94,141,182],"an":[25],"interval-valued":[26,45,67,80,97,126,151,164],"network.":[28],"Thus,":[29],"order":[31],"to":[32,108,137],"light":[33],"these,":[34],"we":[35],"investigate":[36],"a":[37,95,102],"generalized":[38],"kind":[39],"the":[41,59,66,86,114,121,125,138,142,144,150,162,171],"SP":[42],"environment":[47],"namely":[48],"all":[49,155],"pairs":[50,156],"(APSP)":[53],"problem.":[54],"The":[55,168],"main":[56],"contributions":[57],"present":[60],"study":[61],"are":[62],"fivefold:":[63],"(1)":[64],"In":[65,106],"network":[69,99],"consideration,":[71],"each":[72],"arc":[73],"weight":[74],"is":[75,174],"represented":[76],"terms":[78],"number.":[82],"(2)":[83],"We":[84],"seek":[85],"weights":[88,153],"between":[89,117,130],"every":[90,131],"pair":[91,132],"nodes":[93],"given":[96],"based":[100],"dynamic":[103],"approach.":[104],"(3)":[105],"contrast":[107],"most":[109],"existing":[110],"approaches,":[111],"which":[112],"provide":[113],"two":[118,177],"predetermined":[119],"nodes,":[120],"proposed":[122,145,172],"approach":[123,146,173],"provides":[124,161],"nodes.":[134],"(4)":[135],"Similarly":[136],"competing":[139],"methods":[140],"literature,":[143],"not":[147],"only":[148],"gives":[149],"but":[159],"also":[160],"corresponding":[163],"APSP.":[166],"(5)":[167],"efficiency":[169],"illustrated":[175],"through":[176],"applications":[178],"APSP":[180],"wireless":[183],"sensor":[184],"networks":[185],"and":[186],"robot":[187],"planning":[189],"problems.":[190]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}