{"id":"https://openalex.org/W3205752658","doi":"https://doi.org/10.1109/seeda-cecnsm53056.2021.9566273","title":"Revisiting shortest path algorithms for navigation systems","display_name":"Revisiting shortest path algorithms for navigation systems","publication_year":2021,"publication_date":"2021-09-24","ids":{"openalex":"https://openalex.org/W3205752658","doi":"https://doi.org/10.1109/seeda-cecnsm53056.2021.9566273","mag":"3205752658"},"language":"en","primary_location":{"id":"doi:10.1109/seeda-cecnsm53056.2021.9566273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/seeda-cecnsm53056.2021.9566273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5110810078","display_name":"V. Patras","orcid":null},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Vaios Patras","raw_affiliation_strings":["University of Ioannina, Ioannina, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ioannina, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050689726","display_name":"Ioannis Fudos","orcid":"https://orcid.org/0000-0002-4137-0986"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Ioannis Fudos","raw_affiliation_strings":["University of Ioannina, Ioannina, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ioannina, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081804058","display_name":"Kyriakos Koritsoglou","orcid":"https://orcid.org/0000-0002-4041-5169"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Kyriakos Koritsoglou","raw_affiliation_strings":["University of Ioannina, Ioannina, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ioannina, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035635468","display_name":"Georgios Tsoumanis","orcid":"https://orcid.org/0000-0001-9010-3422"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Georgios Tsoumanis","raw_affiliation_strings":["University of Ioannina Campus of Arta, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ioannina Campus of Arta, Greece","institution_ids":["https://openalex.org/I194019607"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I194019607"],"apc_list":null,"apc_paid":null,"fwci":0.1813,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.3771397,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"33","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9977999925613403,"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.9977999925613403,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9943000078201294,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9937999844551086,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8262681365013123},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7103010416030884},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6151598691940308},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6077472567558289},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5764681696891785},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5379970073699951},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5190335512161255},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5102324485778809},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5003666877746582},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.45118388533592224},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4293835759162903},{"id":"https://openalex.org/keywords/navigation-system","display_name":"Navigation system","score":0.4283214211463928},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26075953245162964},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2547433376312256},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11773765087127686},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08779677748680115}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8262681365013123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7103010416030884},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6151598691940308},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6077472567558289},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5764681696891785},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5379970073699951},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5190335512161255},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5102324485778809},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5003666877746582},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.45118388533592224},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4293835759162903},{"id":"https://openalex.org/C2777891301","wikidata":"https://www.wikidata.org/wiki/Q3475123","display_name":"Navigation system","level":2,"score":0.4283214211463928},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26075953245162964},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2547433376312256},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11773765087127686},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08779677748680115}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/seeda-cecnsm53056.2021.9566273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/seeda-cecnsm53056.2021.9566273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.8399999737739563,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G1501043910","display_name":null,"funder_award_id":"T1EDK-00108","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"}],"funders":[{"id":"https://openalex.org/F4320335322","display_name":"European Regional Development Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W49244725","https://openalex.org/W1557047551","https://openalex.org/W2119167984","https://openalex.org/W2120783268","https://openalex.org/W2131058166","https://openalex.org/W2136866103","https://openalex.org/W2140946282","https://openalex.org/W2142311862","https://openalex.org/W2169528473","https://openalex.org/W2604146997","https://openalex.org/W2792630174","https://openalex.org/W6677481295","https://openalex.org/W6680319871","https://openalex.org/W6735648403"],"related_works":["https://openalex.org/W2523719706","https://openalex.org/W2368964068","https://openalex.org/W4386259575","https://openalex.org/W4310271105","https://openalex.org/W4388937056","https://openalex.org/W1990009669","https://openalex.org/W2383241910","https://openalex.org/W2372450449","https://openalex.org/W2367364991","https://openalex.org/W2383519316"],"abstract_inverted_index":{"Efficient":[0],"shortest":[1,14],"path":[2,15],"algorithms":[3,69],"are":[4],"central":[5],"to":[6,73,90,105],"routing":[7],"and":[8,44,50],"navigation":[9,118],"applications.":[10],"However,":[11],"finding":[12,126],"the":[13,61,109,127,135],"is":[16,77,89],"often":[17],"not":[18],"adequate":[19],"for":[20,108,114],"urban":[21],"sidewalk":[22],"routes,":[23],"as":[24],"users":[25],"of":[26,60,86,134,138],"these":[27,82],"applications":[28],"may":[29],"also":[30],"be":[31],"interested":[32],"in":[33,117,131],"alternative":[34,63,112],"routes":[35],"that,":[36],"although":[37],"slightly":[38],"longer,":[39],"have":[40,70],"other":[41],"desirable":[42],"features":[43],"properties":[45],"(i.e.,":[46],"accessibility,":[47],"safety,":[48],"comfort,":[49],"convenience).":[51],"The":[52,84],"k-shortest":[53],"paths":[54,113,130],"(KSP)":[55],"represent":[56],"an":[57],"ordered":[58],"list":[59],"available":[62],"routes.":[64],"Even":[65],"though":[66],"several":[67],"KSP":[68],"been":[71],"proposed,":[72],"our":[74],"knowledge,":[75],"there":[76],"no":[78],"research":[79],"considering":[80],"all":[81],"issues.":[83],"purpose":[85],"this":[87],"paper":[88],"introduce":[91],"a":[92,97],"heuristic":[93],"algorithm":[94],"that":[95],"uses":[96],"penalty":[98],"method":[99],"by":[100],"increasing":[101],"certain":[102],"edge":[103],"weights,":[104],"effectively":[106],"search":[107],"most":[110,128],"accessible":[111,129],"multi-route":[115],"cases":[116],"systems.":[119],"We":[120],"then":[121],"present":[122],"experimental":[123],"results":[124],"on":[125],"pedestrian":[132],"sections":[133],"historical":[136],"center":[137],"Thessaloniki":[139],"city.":[140]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}