{"id":"https://openalex.org/W3135251135","doi":"https://doi.org/10.1142/s0218488521500116","title":"Fuzzy Constrained Shortest Path Problem for Location-Based Online Services","display_name":"Fuzzy Constrained Shortest Path Problem for Location-Based Online Services","publication_year":2021,"publication_date":"2021-03-09","ids":{"openalex":"https://openalex.org/W3135251135","doi":"https://doi.org/10.1142/s0218488521500116","mag":"3135251135"},"language":"en","primary_location":{"id":"doi:10.1142/s0218488521500116","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218488521500116","pdf_url":null,"source":{"id":"https://openalex.org/S69518169","display_name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","issn_l":"0218-4885","issn":["0218-4885","1793-6411"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Uncertainty, Fuzziness and Knowledge-Based 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/A5049238184","display_name":"Ali Abbaszadeh Sori","orcid":"https://orcid.org/0000-0001-7070-4722"},"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":"Ali Abbaszadeh Sori","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":"Ali 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/A5103062523","display_name":"Homayun Motameni","orcid":"https://orcid.org/0000-0003-1309-6569"},"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":"Homayun 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/A5010560354","display_name":"Jos\u00e9 Lu\u00eds Verdegay","orcid":"https://orcid.org/0000-0003-2487-942X"},"institutions":[{"id":"https://openalex.org/I173304897","display_name":"Universidad de Granada","ror":"https://ror.org/04njjy449","country_code":"ES","type":"education","lineage":["https://openalex.org/I173304897"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Jose Luis Verdegay","raw_affiliation_strings":["Department of Computer Science and Artificial Intelligence, ETS de Ingenier\u00edas Inform\u00e1tica y de Telecomunicaci\u00f3n, Universidad de Granada, 18014 Granada, Spain"],"raw_orcid":"https://orcid.org/0000-0003-2487-942X","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Artificial Intelligence, ETS de Ingenier\u00edas Inform\u00e1tica y de Telecomunicaci\u00f3n, Universidad de Granada, 18014 Granada, Spain","institution_ids":["https://openalex.org/I173304897"]}]}],"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":1.8523,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.85520059,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"02","first_page":"231","last_page":"248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9921000003814697,"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.9921000003814697,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9869999885559082,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10698","display_name":"Transportation Planning and Optimization","score":0.9865999817848206,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7667479515075684},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7059305310249329},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6699041128158569},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.651244580745697},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6263020634651184},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5671531558036804},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.5019657611846924},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.49952054023742676},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4524374008178711},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.37842029333114624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19898098707199097},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.186977356672287},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17421701550483704},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1298791468143463},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1053544282913208},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10026600956916809}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7667479515075684},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7059305310249329},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6699041128158569},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.651244580745697},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6263020634651184},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5671531558036804},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.5019657611846924},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.49952054023742676},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4524374008178711},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.37842029333114624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19898098707199097},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.186977356672287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17421701550483704},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1298791468143463},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1053544282913208},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10026600956916809}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218488521500116","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218488521500116","pdf_url":null,"source":{"id":"https://openalex.org/S69518169","display_name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","issn_l":"0218-4885","issn":["0218-4885","1793-6411"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4223969905","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/W2170980056","https://openalex.org/W4310124294"],"abstract_inverted_index":{"One":[0],"of":[1,26,33,58,74,88,92,134],"the":[2,11,22,31,39,67,71,75,93,107,118,126,135],"important":[3,48],"issues":[4],"under":[5],"discussion":[6],"connected":[7],"with":[8,66,110],"traffic":[9,100],"on":[10,140],"roads":[12],"is":[13,25,54,61,95,130,138],"improving":[14],"transportation.":[15],"In":[16],"this":[17,59,104],"regard,":[18],"spatial":[19],"information,":[20],"including":[21],"shortest":[23,41],"path,":[24],"particular":[27],"importance":[28],"due":[29,98],"to":[30,62,99],"reduction":[32],"economic":[34],"and":[35,90,101,113],"environmental":[36],"costs.":[37],"Here,":[38],"constrained":[40,127],"path":[42,65,76,129],"(CSP)":[43],"problem":[44,60,120],"which":[45],"has":[46],"an":[47,121],"application":[49,133],"in":[50],"location-based":[51,142],"online":[52,143],"services":[53],"considered.":[55],"The":[56,132],"aim":[57],"find":[63],"a":[64,81,141],"lowest":[68],"cost":[69,89,112],"where":[70],"traversal":[72],"time":[73,83,91],"does":[77],"not":[78,96],"exceed":[79],"from":[80],"predetermined":[82],"bound.":[84],"Since":[85],"precise":[86],"prediction":[87],"paths":[94],"possible":[97],"weather":[102],"conditions,":[103],"paper":[105],"discusses":[106],"CSP":[108,119],"problems":[109],"fuzzy":[111,114],"time.":[115],"After":[116],"formulating":[117],"efficient":[122],"algorithm":[123],"for":[124],"finding":[125],"optimal":[128],"designed.":[131],"proposed":[136],"model":[137],"presented":[139],"service":[144],"called":[145],"Snap.":[146]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}