{"id":"https://openalex.org/W2588785842","doi":"https://doi.org/10.1109/ssci.2016.7850151","title":"Application of Dijkstra algorithm for solving interval valued neutrosophic shortest path problem","display_name":"Application of Dijkstra algorithm for solving interval valued neutrosophic shortest path problem","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2588785842","doi":"https://doi.org/10.1109/ssci.2016.7850151","mag":"2588785842"},"language":"en","primary_location":{"id":"doi:10.1109/ssci.2016.7850151","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2016.7850151","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-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/A5054208274","display_name":"Said Broumi","orcid":"https://orcid.org/0000-0002-1334-5759"},"institutions":[{"id":"https://openalex.org/I99297268","display_name":"University of Hassan II Casablanca","ror":"https://ror.org/001q4kn48","country_code":"MA","type":"education","lineage":["https://openalex.org/I99297268"]}],"countries":["MA"],"is_corresponding":true,"raw_author_name":"Said Broumi","raw_affiliation_strings":["Faculty of science Ben M'sik, University Hassan II, Casablanca, Morocco"],"affiliations":[{"raw_affiliation_string":"Faculty of science Ben M'sik, University Hassan II, Casablanca, Morocco","institution_ids":["https://openalex.org/I99297268"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057080990","display_name":"Mohamed Talea","orcid":"https://orcid.org/0000-0003-2364-0804"},"institutions":[{"id":"https://openalex.org/I99297268","display_name":"University of Hassan II Casablanca","ror":"https://ror.org/001q4kn48","country_code":"MA","type":"education","lineage":["https://openalex.org/I99297268"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Mohamed Talea","raw_affiliation_strings":["Faculty of science Ben M'sik, University Hassan II, Casablanca, Morocco"],"affiliations":[{"raw_affiliation_string":"Faculty of science Ben M'sik, University Hassan II, Casablanca, Morocco","institution_ids":["https://openalex.org/I99297268"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078567590","display_name":"Assia Bakali","orcid":"https://orcid.org/0000-0002-2764-9745"},"institutions":[{"id":"https://openalex.org/I4210165748","display_name":"\u00c9cole Royale Navale","ror":"https://ror.org/05pa24340","country_code":"MA","type":"education","lineage":["https://openalex.org/I4210165748"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Assia Bakali","raw_affiliation_strings":["Ecole Royale Navale, Casablanca, Morocco"],"affiliations":[{"raw_affiliation_string":"Ecole Royale Navale, Casablanca, Morocco","institution_ids":["https://openalex.org/I4210165748"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012703845","display_name":"Florent\u00edn Smarandache","orcid":"https://orcid.org/0000-0002-5560-5926"},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]},{"id":"https://openalex.org/I4210118010","display_name":"Gallup Indian Medical Center","ror":"https://ror.org/02jbzrw51","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I1299022934","https://openalex.org/I157850169","https://openalex.org/I4210118010"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Florentin Smarandache","raw_affiliation_strings":["Department of Mathematics, University of New Mexico, Gallup, NM"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of New Mexico, Gallup, NM","institution_ids":["https://openalex.org/I4210118010","https://openalex.org/I169521973"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5054208274"],"corresponding_institution_ids":["https://openalex.org/I99297268"],"apc_list":null,"apc_paid":null,"fwci":5.3858,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.95692762,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9990000128746033,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12135","display_name":"Fuzzy Systems and Optimization","score":0.9690999984741211,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8985515832901001},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7826963663101196},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.7662112712860107},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6958580017089844},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6857408881187439},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6561915278434753},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.5973250865936279},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5661541819572449},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5567255616188049},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5562992691993713},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.5177145004272461},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5103635191917419},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37105607986450195},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3536592423915863},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.306060791015625},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1863420307636261},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1816261112689972},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14348891377449036}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8985515832901001},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7826963663101196},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.7662112712860107},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6958580017089844},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6857408881187439},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6561915278434753},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5973250865936279},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5661541819572449},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5567255616188049},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5562992691993713},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5177145004272461},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5103635191917419},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37105607986450195},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3536592423915863},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.306060791015625},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1863420307636261},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1816261112689972},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14348891377449036},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci.2016.7850151","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2016.7850151","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W58991120","https://openalex.org/W1704940532","https://openalex.org/W1942831270","https://openalex.org/W1973193054","https://openalex.org/W1977923684","https://openalex.org/W1980564456","https://openalex.org/W2027207999","https://openalex.org/W2068402605","https://openalex.org/W2074029308","https://openalex.org/W2091226080","https://openalex.org/W2156431668","https://openalex.org/W2169528473","https://openalex.org/W2188945014","https://openalex.org/W2253366167","https://openalex.org/W2336848886","https://openalex.org/W2346004391","https://openalex.org/W2557659449","https://openalex.org/W2617569124","https://openalex.org/W2912565176","https://openalex.org/W2950293330","https://openalex.org/W2963759895","https://openalex.org/W2964289368","https://openalex.org/W3100037679","https://openalex.org/W4211007335","https://openalex.org/W4292078529","https://openalex.org/W4297729329","https://openalex.org/W4300783694","https://openalex.org/W6602379895","https://openalex.org/W6637606330","https://openalex.org/W6640628040","https://openalex.org/W6687086122","https://openalex.org/W6691753490","https://openalex.org/W6696666463","https://openalex.org/W6704635665","https://openalex.org/W6738466611"],"related_works":["https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2136320479","https://openalex.org/W2348287729","https://openalex.org/W3183360588","https://openalex.org/W2375280931","https://openalex.org/W2387829241","https://openalex.org/W2352589493","https://openalex.org/W2391048224","https://openalex.org/W2978166001"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"the":[3,14,21,40],"authors":[4],"propose":[5],"an":[6,27],"extended":[7],"version":[8],"of":[9],"Dijkstra'":[10],"algorithm":[11],"for":[12],"finding":[13],"shortest":[15],"path":[16],"on":[17],"a":[18,33],"network":[19],"where":[20],"edge":[22],"weights":[23],"are":[24],"characterized":[25],"by":[26],"interval":[28],"valued":[29],"neutrosophic":[30],"numbers.":[31],"Finally,":[32],"numerical":[34],"example":[35],"is":[36],"given":[37],"to":[38],"explain":[39],"proposed":[41],"algorithm.":[42]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}