{"id":"https://openalex.org/W2574533596","doi":"https://doi.org/10.1109/skima.2016.7916216","title":"Shortest path problem under triangular fuzzy neutrosophic information","display_name":"Shortest path problem under triangular fuzzy neutrosophic information","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2574533596","doi":"https://doi.org/10.1109/skima.2016.7916216","mag":"2574533596"},"language":"en","primary_location":{"id":"doi:10.1109/skima.2016.7916216","is_oa":false,"landing_page_url":"https://doi.org/10.1109/skima.2016.7916216","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://digitalrepository.unm.edu/math_fsp/406","any_repository_has_fulltext":true},"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":false,"raw_author_name":"Said Broumi","raw_affiliation_strings":["Faculty of Science Ben M'Sik, University Hassan II, Casablanca, Morocco"],"raw_orcid":null,"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, Boulevard Sour Jdid, Casablanca, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Royale Navale, Boulevard Sour Jdid, Casablanca, Morocco","institution_ids":["https://openalex.org/I4210165748"]}]},{"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"],"raw_orcid":null,"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/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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Florentin Smarandache","raw_affiliation_strings":["Department of Mathematics, University of New Mexico, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of New Mexico, NM, USA","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103491381","display_name":"Luige Vl\u0103d\u0103reanu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210126371","display_name":"Institute of Solid Mechanics","ror":"https://ror.org/0307mca49","country_code":"RO","type":"facility","lineage":["https://openalex.org/I4210126371"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Luige Vladareanu","raw_affiliation_strings":["Institute of Solid Mechanics, Romanian Academy, Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Solid Mechanics, Romanian Academy, Bucharest, Romania","institution_ids":["https://openalex.org/I4210126371"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.7151,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.96730592,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"169","last_page":"174"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.996999979019165,"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.996999979019165,"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/T11671","display_name":"Fuzzy and Soft Set Theory","score":0.948199987411499,"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.9294999837875366,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8556085824966431},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6929796934127808},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6159439086914062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5438485741615295},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5285640954971313},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.5240079164505005},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5219818353652954},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.47936755418777466},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.47411873936653137},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.47132614254951477},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.44339093565940857},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4153582453727722},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.383794903755188},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3592923879623413},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3392640948295593},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3376274108886719},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2856414318084717},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08274543285369873},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07923489809036255}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8556085824966431},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6929796934127808},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6159439086914062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5438485741615295},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5285640954971313},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.5240079164505005},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5219818353652954},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.47936755418777466},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.47411873936653137},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.47132614254951477},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.44339093565940857},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4153582453727722},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.383794903755188},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3592923879623413},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3392640948295593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3376274108886719},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2856414318084717},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08274543285369873},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07923489809036255},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/skima.2016.7916216","is_oa":false,"landing_page_url":"https://doi.org/10.1109/skima.2016.7916216","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)","raw_type":"proceedings-article"},{"id":"pmh:oai:digitalrepository.unm.edu:math_fsp-1409","is_oa":true,"landing_page_url":"https://digitalrepository.unm.edu/math_fsp/406","pdf_url":null,"source":{"id":"https://openalex.org/S4377196368","display_name":"UNM\u2019s Digital Repository (University of New Mexico)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169521973","host_organization_name":"University of New Mexico","host_organization_lineage":["https://openalex.org/I169521973"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Branch Mathematics and Statistics Faculty and Staff Publications","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:digitalrepository.unm.edu:math_fsp-1409","is_oa":true,"landing_page_url":"https://digitalrepository.unm.edu/math_fsp/406","pdf_url":null,"source":{"id":"https://openalex.org/S4377196368","display_name":"UNM\u2019s Digital Repository (University of New Mexico)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169521973","host_organization_name":"University of New Mexico","host_organization_lineage":["https://openalex.org/I169521973"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Branch Mathematics and Statistics Faculty and Staff Publications","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W58991120","https://openalex.org/W1164749899","https://openalex.org/W1273809832","https://openalex.org/W1958351399","https://openalex.org/W1980564456","https://openalex.org/W2027207999","https://openalex.org/W2030614781","https://openalex.org/W2074029308","https://openalex.org/W2087463697","https://openalex.org/W2140034637","https://openalex.org/W2175296508","https://openalex.org/W2178025158","https://openalex.org/W2236964736","https://openalex.org/W2253366167","https://openalex.org/W3100037679","https://openalex.org/W3131612100","https://openalex.org/W4211007335","https://openalex.org/W6602379895","https://openalex.org/W6627582189","https://openalex.org/W6640919577"],"related_works":["https://openalex.org/W4253588386","https://openalex.org/W2810620529","https://openalex.org/W2381419702","https://openalex.org/W1562631103","https://openalex.org/W2170980056","https://openalex.org/W2348177054","https://openalex.org/W2136320479","https://openalex.org/W1508906807","https://openalex.org/W4285816407","https://openalex.org/W2367161887"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"develop":[4],"a":[5,16],"new":[6],"approach":[7],"to":[8,44,57],"deal":[9],"with":[10],"neutrosphic":[11],"shortest":[12,38],"path":[13,39],"problem":[14],"in":[15,18],"network":[17],"which":[19],"each":[20],"edge":[21],"weight":[22],"(or":[23],"length)":[24],"is":[25,54],"represented":[26],"as":[27],"triangular":[28],"fuzzy":[29],"neutrosophic":[30],"number.":[31],"The":[32],"proposed":[33,60],"algorithm":[34],"also":[35,55],"gives":[36],"the":[37],"length":[40],"from":[41],"source":[42],"node":[43,46],"destination":[45],"using":[47],"ranking":[48],"function.":[49],"Finally,":[50],"an":[51],"illustrative":[52],"example":[53],"included":[56],"demonstrate":[58],"our":[59],"approach.":[61]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}