{"id":"https://openalex.org/W4214758195","doi":"https://doi.org/10.1109/imcom53663.2022.9721805","title":"An Efficient Multi-Criteria Path Selection Approach in Road Networks through Influencer Nodes and K-hop Search","display_name":"An Efficient Multi-Criteria Path Selection Approach in Road Networks through Influencer Nodes and K-hop Search","publication_year":2022,"publication_date":"2022-01-03","ids":{"openalex":"https://openalex.org/W4214758195","doi":"https://doi.org/10.1109/imcom53663.2022.9721805"},"language":"en","primary_location":{"id":"doi:10.1109/imcom53663.2022.9721805","is_oa":false,"landing_page_url":"https://doi.org/10.1109/imcom53663.2022.9721805","pdf_url":null,"source":{"id":"https://openalex.org/S4363608555","display_name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","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/A5101890042","display_name":"Zeeshan Ali","orcid":"https://orcid.org/0000-0002-9674-4359"},"institutions":[{"id":"https://openalex.org/I201384688","display_name":"National University of Computer and Emerging Sciences","ror":"https://ror.org/003eyb898","country_code":"PK","type":"education","lineage":["https://openalex.org/I201384688"]}],"countries":["PK"],"is_corresponding":true,"raw_author_name":"Zeeshan Ali","raw_affiliation_strings":["FAST-NUCES,Dept. of Computer Science,Islamabad,Pakistan"],"affiliations":[{"raw_affiliation_string":"FAST-NUCES,Dept. of Computer Science,Islamabad,Pakistan","institution_ids":["https://openalex.org/I201384688"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084823078","display_name":"Waqas Nawaz","orcid":"https://orcid.org/0000-0002-9989-6163"},"institutions":[{"id":"https://openalex.org/I4210151290","display_name":"Islamic University of Madinah","ror":"https://ror.org/03rcp1y74","country_code":"SA","type":"education","lineage":["https://openalex.org/I4210151290"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Waqas Nawaz","raw_affiliation_strings":["Islamic University of Madinah,Dept. of Computer and Information Systems,Madinah,Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"Islamic University of Madinah,Dept. of Computer and Information Systems,Madinah,Saudi Arabia","institution_ids":["https://openalex.org/I4210151290"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045182513","display_name":"Kifayat Ullah Khan","orcid":"https://orcid.org/0000-0002-3916-1659"},"institutions":[{"id":"https://openalex.org/I201384688","display_name":"National University of Computer and Emerging Sciences","ror":"https://ror.org/003eyb898","country_code":"PK","type":"education","lineage":["https://openalex.org/I201384688"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Kifayat Ullah Khan","raw_affiliation_strings":["FAST-NUCES,Dept. of Computer Science,Islamabad,Pakistan"],"affiliations":[{"raw_affiliation_string":"FAST-NUCES,Dept. of Computer Science,Islamabad,Pakistan","institution_ids":["https://openalex.org/I201384688"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101890042"],"corresponding_institution_ids":["https://openalex.org/I201384688"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00189573,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9722999930381775,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9721999764442444,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"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/computer-science","display_name":"Computer science","score":0.736143171787262},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.612899899482727},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5449265241622925},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.49895429611206055},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4765920341014862},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46940910816192627},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4195582866668701},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4163277745246887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3513343334197998},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2353578507900238},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2117001712322235},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12869715690612793},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08089339733123779}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.736143171787262},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.612899899482727},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5449265241622925},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.49895429611206055},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4765920341014862},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46940910816192627},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4195582866668701},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4163277745246887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3513343334197998},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2353578507900238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2117001712322235},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12869715690612793},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08089339733123779}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/imcom53663.2022.9721805","is_oa":false,"landing_page_url":"https://doi.org/10.1109/imcom53663.2022.9721805","pdf_url":null,"source":{"id":"https://openalex.org/S4363608555","display_name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7099999785423279,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1549128498","https://openalex.org/W1829285201","https://openalex.org/W1990336586","https://openalex.org/W2005854848","https://openalex.org/W2005945380","https://openalex.org/W2032158203","https://openalex.org/W2095293504","https://openalex.org/W2104317982","https://openalex.org/W2126455549","https://openalex.org/W2146591355","https://openalex.org/W2755088640","https://openalex.org/W2791658191","https://openalex.org/W2913092739","https://openalex.org/W2949259103","https://openalex.org/W3186417409","https://openalex.org/W6744271739"],"related_works":["https://openalex.org/W2183638083","https://openalex.org/W2119138398","https://openalex.org/W2306351532","https://openalex.org/W2598979711","https://openalex.org/W2037384153","https://openalex.org/W2129550502","https://openalex.org/W2009808060","https://openalex.org/W2093961518","https://openalex.org/W2372801012","https://openalex.org/W2898676476"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,82,99,122],"efficient":[3,83],"approach":[4],"for":[5],"a":[6,24,32,65,71,91,108],"multi-criteria":[7,37],"path":[8,38,127],"selection":[9],"problem":[10,62],"in":[11,23,86,129,161,174],"road":[12,92],"networks.":[13],"Since,":[14],"computing":[15],"shortest":[16],"paths":[17],"among":[18],"all":[19,54],"pairs":[20],"of":[21,74,96,111,131,133,146,163],"nodes":[22],"large":[25,72],"network":[26,50,93],"is":[27,119],"computationally":[28],"expensive":[29],"even":[30],"with":[31,51,94,171],"single":[33],"criterion.":[34],"Therefore,":[35],"performing":[36],"search":[39],"becomes":[40],"costly":[41],"and":[42,102],"inefficient":[43],"due":[44],"to":[45,106,120,142],"excessive":[46],"traversals":[47],"over":[48],"the":[49,60,144,147,155,165],"comparisons":[52],"between":[53],"possible":[55],"paths.":[56],"Existing":[57],"algorithm":[58,105,157],"solved":[59],"aforementioned":[61],"by":[63],"introducing":[64],"reference":[66],"point":[67],"but":[68],"they":[69],"performed":[70],"number":[73,110,132],"offline":[75],"pre-computations.":[76],"In":[77],"this":[78],"paper,":[79],"we":[80,88],"introduce":[81],"multi-criteria-based":[84],"approach,":[85],"which":[87],"uniquely":[89],"model":[90],"places":[95],"interest":[97],"into":[98],"attributed":[100],"graph":[101],"restrict":[103],"our":[104],"explore":[107],"minimum":[109,126],"hops":[112,134],"while":[113,135,167],"satisfying":[114],"maximum":[115,137],"criteria.":[116,138],"Our":[117],"objective":[118],"get":[121],"optimal":[123],"path,":[124],"having":[125],"length":[128],"terms":[130,162],"meeting":[136],"Experiments":[139],"are":[140],"conducted":[141],"verify":[143],"effectiveness":[145],"proposed":[148,156],"approach.":[149],"The":[150],"experimental":[151],"results":[152],"depict":[153],"that":[154],"achieves":[158],"high":[159],"accuracy":[160],"fulfilling":[164],"criteria":[166],"avoiding":[168],"pre-processing":[169],"steps":[170],"minor":[172],"change":[173],"execution":[175],"time.":[176]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}