乐胖代购免代理版

{"id":"https://openalex.org/W4308087267","doi":"https://doi.org/10.1109/isc255366.2022.9921790","title":"Multi-Path Routing Algorithm for Inclusive Mobility in an Urban Environment","display_name":"Multi-Path Routing Algorithm for Inclusive Mobility in an Urban Environment","publication_year":2022,"publication_date":"2022-09-26","ids":{"openalex":"https://openalex.org/W4308087267","doi":"https://doi.org/10.1109/isc255366.2022.9921790"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/isc255366.2022.9921790","pdf_url":null,"source":{"id":"https://openalex.org/S4363608314","display_name":"2022 IEEE International Smart Cities Conference (ISC2)","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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":"http://repositorio.ipvc.pt/bitstream/20.500.11960/3153/1/2022_11.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069260175","display_name":"Hugo de Brito Machado","orcid":null},"institutions":[{"id":"https://openalex.org/I192341844","display_name":"Polytechnic Institute of Viana do Castelo","ror":"https://ror.org/03w6kry90","country_code":"PT","type":"education","lineage":["https://openalex.org/I192341844"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Hugo Machado","raw_affiliation_strings":["ADiT-LAB, Instituto Politécnico de Viana do Castelo,Viana do Castelo,Portugal,4900-347"],"affiliations":[{"raw_affiliation_string":"ADiT-LAB, Instituto Politécnico de Viana do Castelo,Viana do Castelo,Portugal,4900-347","institution_ids":["https://openalex.org/I192341844"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050462811","display_name":"Sara Paiva","orcid":"https://orcid.org/0000-0002-0041-8939"},"institutions":[{"id":"https://openalex.org/I192341844","display_name":"Polytechnic Institute of Viana do Castelo","ror":"https://ror.org/03w6kry90","country_code":"PT","type":"education","lineage":["https://openalex.org/I192341844"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Sara Paiva","raw_affiliation_strings":["ADiT-LAB, Instituto Politécnico de Viana do Castelo,Viana do Castelo,Portugal,4900-347"],"affiliations":[{"raw_affiliation_string":"ADiT-LAB, Instituto Politécnico de Viana do Castelo,Viana do Castelo,Portugal,4900-347","institution_ids":["https://openalex.org/I192341844"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019444520","display_name":"Ana I. Pereira","orcid":"https://orcid.org/0000-0003-3803-2043"},"institutions":[{"id":"https://openalex.org/I4210092303","display_name":"Polytechnic Institute of Bragan\u00e7a","ror":"https://ror.org/00prsav78","country_code":"PT","type":"education","lineage":["https://openalex.org/I4210092303"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Ana I. Pereira","raw_affiliation_strings":["CeDRI Polytechnic Institute of Bragança,Bragança,Portugal,5300-253"],"affiliations":[{"raw_affiliation_string":"CeDRI Polytechnic Institute of Bragança,Bragança,Portugal,5300-253","institution_ids":["https://openalex.org/I4210092303"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":60},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9966,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9966,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9906,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T11106","display_name":"Data Management and Algorithms","score":0.9841,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4253362},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.4250509}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8114723},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7722621},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7444887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5165035},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49661428},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.49326724},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4689122},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43266445},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4253362},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4250509},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.37274086},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.28389055},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.22085091},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19218892},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14964649}],"mesh":[],"locations_count":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/isc255366.2022.9921790","pdf_url":null,"source":{"id":"https://openalex.org/S4363608314","display_name":"2022 IEEE International Smart Cities Conference (ISC2)","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":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://hdl.handle.net/20.500.11960/3153","pdf_url":"http://repositorio.ipvc.pt/bitstream/20.500.11960/3153/1/2022_11.pdf","source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://hdl.handle.net/20.500.11960/3153","pdf_url":"http://repositorio.ipvc.pt/bitstream/20.500.11960/3153/1/2022_11.pdf","source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.82,"id":"https://metadata.un.org/sdg/11"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":15,"referenced_works":["https://openalex.org/W1973965110","https://openalex.org/W1998806931","https://openalex.org/W2113941156","https://openalex.org/W2137200456","https://openalex.org/W2346019866","https://openalex.org/W2766724791","https://openalex.org/W2895816371","https://openalex.org/W2918956229","https://openalex.org/W2950398041","https://openalex.org/W2953666713","https://openalex.org/W2990810577","https://openalex.org/W3010490505","https://openalex.org/W3161992262","https://openalex.org/W3200553870","https://openalex.org/W3206804387"],"related_works":["https://openalex.org/W4402599120","https://openalex.org/W4310124294","https://openalex.org/W4281943708","https://openalex.org/W3205035283","https://openalex.org/W3198947419","https://openalex.org/W2990531685","https://openalex.org/W2886722595","https://openalex.org/W2382258861","https://openalex.org/W2363342665","https://openalex.org/W2136320479"],"abstract_inverted_index":{"The":[0,80,136,152],"concept":[1],"of":[2,14,16,55,110],"smart":[3],"city":[4],"is":[5,52],"frequently":[6],"used":[7],"nowa-days":[8],"to":[9,11,39,63,92,169],"refer":[10],"the":[12,37,65,88,97,102,116,119,162,170],"level":[13],"integration":[15],"cities":[17],"with":[18,73,126],"citizen":[19],"services.":[20],"Mobility":[21],"and":[22,76,100,118,129,133,146,159],"navigation":[23],"are":[24,47,113],"some":[25],"examples.":[26],"When":[27],"considering":[28,87],"disabled":[29],"users,":[30],"in":[31,43,96],"a":[32,56,60,84],"temporary":[33],"or":[34,164],"permanent":[35],"way,":[36],"challenges":[38],"provide":[40],"such":[41],"services":[42],"an":[44,53],"efficient":[45],"way":[46],"even":[48],"bigger.":[49],"This":[50],"paper":[51],"extension":[54],"previous":[57],"work":[58,82],"where":[59],"mobile":[61,98],"application":[62,99],"recommend":[64],"most":[66,103],"suitable":[67,104],"route":[68,105],"for":[69],"citizens":[70],"was":[71],"implemented":[72],"both":[74],"Dijkstra":[75],"A":[77],"-Star":[78],"algorithms.":[79],"presented":[81,114,156],"describes":[83],"multi-path":[85],"approach":[86],"user":[89],"might":[90],"want":[91],"choose":[93],"several":[94],"destinations":[95],"obtain":[101],"that":[106],"goes":[107],"through":[108],"all":[109],"them.":[111],"Results":[112],"using":[115],"Genetic":[117,171],"Simulated":[120,153],"Annealing":[121,154],"Algorithms.":[122],"Both":[123],"were":[124,150],"evaluated":[125],"100":[127],"runs":[128],"2,":[130],"4,":[131],"8":[132],"16":[134],"destinations.":[135],"average":[137],"algorithm":[138],"execution":[139,148],"time,":[140],"standard":[141],"deviation,":[142],"median":[143],"value,":[144],"maximum":[145],"minimum":[147],"times":[149],"assessed.":[151],"Algorithm":[155],"better":[157],"results":[158],"always":[160],"suggested":[161],"shorter,":[163],"equal,":[165],"path":[166],"when":[167],"comparing":[168],"Algorithm.":[172]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4308087267","counts_by_year":[],"updated_date":"2025-01-03T00:11:41.359098","created_date":"2022-11-08"}