{"id":"https://openalex.org/W4221129498","doi":"https://doi.org/10.1007/s00500-022-06871-w","title":"An improved weighted sum-fuzzy Dijkstra\u2019s algorithm for shortest path problem (iWSFDA)","display_name":"An improved weighted sum-fuzzy Dijkstra\u2019s algorithm for shortest path problem (iWSFDA)","publication_year":2022,"publication_date":"2022-03-07","ids":{"openalex":"https://openalex.org/W4221129498","doi":"https://doi.org/10.1007/s00500-022-06871-w"},"language":"en","primary_location":{"id":"doi:10.1007/s00500-022-06871-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-022-06871-w","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","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/A5038395173","display_name":"Chanchal Dudeja","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chanchal Dudeja","raw_affiliation_strings":["Department of Mathematics, Amity University, Gurgaon, Haryana, 122413, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Amity University, Gurgaon, Haryana, 122413, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100711939","display_name":"Pawan Kumar","orcid":"https://orcid.org/0000-0003-4140-1006"},"institutions":[{"id":"https://openalex.org/I4210133503","display_name":"Central University of Haryana","ror":"https://ror.org/03mtwkv54","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210133503"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Pawan Kumar","raw_affiliation_strings":["Department of Mathematics, Central University of Haryana, Mahendergarh, 123031, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Central University of Haryana, Mahendergarh, 123031, India","institution_ids":["https://openalex.org/I4210133503"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038395173"],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":3.4349,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.93068315,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"26","issue":"7","first_page":"3217","last_page":"3226"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9708999991416931,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9700999855995178,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8832770586013794},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8736028671264648},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.7997699975967407},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6591322422027588},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6532834768295288},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6211029291152954},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.603564977645874},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.598357081413269},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.5438026785850525},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.513144314289093},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.5124054551124573},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5013911724090576},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4274212419986725},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4159787893295288},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4109497368335724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3085179328918457},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23846882581710815},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.193983256816864},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19350206851959229}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8832770586013794},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8736028671264648},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.7997699975967407},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6591322422027588},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6532834768295288},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6211029291152954},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.603564977645874},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.598357081413269},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.5438026785850525},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.513144314289093},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5124054551124573},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5013911724090576},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4274212419986725},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4159787893295288},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4109497368335724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3085179328918457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23846882581710815},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.193983256816864},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19350206851959229},{"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.1007/s00500-022-06871-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-022-06871-w","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2800961168","https://openalex.org/W2810842148","https://openalex.org/W2888899161","https://openalex.org/W2898895018","https://openalex.org/W2902943786","https://openalex.org/W2907080458","https://openalex.org/W2910579801","https://openalex.org/W2916415454","https://openalex.org/W2946867748","https://openalex.org/W2947501077","https://openalex.org/W2949581983","https://openalex.org/W2951040842","https://openalex.org/W2954452495","https://openalex.org/W2992781546","https://openalex.org/W3002550154","https://openalex.org/W3006730176","https://openalex.org/W4236730940"],"related_works":["https://openalex.org/W2597144308","https://openalex.org/W2368964068","https://openalex.org/W2372450449","https://openalex.org/W2523719706","https://openalex.org/W2356791911","https://openalex.org/W2161960576","https://openalex.org/W2391130892","https://openalex.org/W1617152041","https://openalex.org/W2358094779","https://openalex.org/W2383519316"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}