{"id":"https://openalex.org/W4308080058","doi":"https://doi.org/10.1109/itsc55140.2022.9922586","title":"Heuristics for Fast One-to-Many Multicriteria Shortest Path Search","display_name":"Heuristics for Fast One-to-Many Multicriteria Shortest Path Search","publication_year":2022,"publication_date":"2022-10-08","ids":{"openalex":"https://openalex.org/W4308080058","doi":"https://doi.org/10.1109/itsc55140.2022.9922586"},"language":"en","primary_location":{"id":"doi:10.1109/itsc55140.2022.9922586","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc55140.2022.9922586","pdf_url":null,"source":{"id":"https://openalex.org/S4363607737","display_name":"2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)","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 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)","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/A5037132981","display_name":"Temirlan Kurbanov","orcid":"https://orcid.org/0000-0001-9439-6066"},"institutions":[{"id":"https://openalex.org/I151321946","display_name":"Center for Economic Research and Graduate Education \u2013 Economics Institute","ror":"https://ror.org/0362ttz08","country_code":"CZ","type":"education","lineage":["https://openalex.org/I151321946"]},{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Temirlan Kurbanov","raw_affiliation_strings":["FEE CTU,Department of Computer Science,Prague,Czech Republic","Department of Computer Science, FEE CTU, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"FEE CTU,Department of Computer Science,Prague,Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Department of Computer Science, FEE CTU, Prague, Czech Republic","institution_ids":["https://openalex.org/I151321946","https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050481632","display_name":"Marek Cuch\u00fd","orcid":"https://orcid.org/0000-0002-4930-7500"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]},{"id":"https://openalex.org/I151321946","display_name":"Center for Economic Research and Graduate Education \u2013 Economics Institute","ror":"https://ror.org/0362ttz08","country_code":"CZ","type":"education","lineage":["https://openalex.org/I151321946"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Marek Cuchy","raw_affiliation_strings":["FEE CTU,Department of Computer Science,Prague,Czech Republic","Department of Computer Science, FEE CTU, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"FEE CTU,Department of Computer Science,Prague,Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Department of Computer Science, FEE CTU, Prague, Czech Republic","institution_ids":["https://openalex.org/I151321946","https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037486016","display_name":"Ji\u0159\u00ed Vok\u0159\u00ednek","orcid":"https://orcid.org/0000-0003-3294-3030"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]},{"id":"https://openalex.org/I151321946","display_name":"Center for Economic Research and Graduate Education \u2013 Economics Institute","ror":"https://ror.org/0362ttz08","country_code":"CZ","type":"education","lineage":["https://openalex.org/I151321946"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jiri Vokrinek","raw_affiliation_strings":["FEE CTU,Department of Computer Science,Prague,Czech Republic","Department of Computer Science, FEE CTU, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"FEE CTU,Department of Computer Science,Prague,Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Department of Computer Science, FEE CTU, Prague, Czech Republic","institution_ids":["https://openalex.org/I151321946","https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037132981"],"corresponding_institution_ids":["https://openalex.org/I151321946","https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.6935,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60248877,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"82","issue":null,"first_page":"594","last_page":"599"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9839000105857849,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9839000105857849,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9825999736785889,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9613000154495239,"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/heuristics","display_name":"Heuristics","score":0.8580366969108582},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7424539923667908},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6470767855644226},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6192073225975037},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5962852835655212},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.545131266117096},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4379803240299225},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3404545783996582},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2599289119243622},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.13060393929481506},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07298204302787781}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8580366969108582},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7424539923667908},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6470767855644226},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6192073225975037},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5962852835655212},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.545131266117096},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4379803240299225},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3404545783996582},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2599289119243622},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.13060393929481506},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07298204302787781},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itsc55140.2022.9922586","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc55140.2022.9922586","pdf_url":null,"source":{"id":"https://openalex.org/S4363607737","display_name":"2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)","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 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W640136309","https://openalex.org/W1513540105","https://openalex.org/W1968535060","https://openalex.org/W2039591135","https://openalex.org/W2051956023","https://openalex.org/W2098071565","https://openalex.org/W2149079374","https://openalex.org/W2229053133","https://openalex.org/W2293465224","https://openalex.org/W2502134040","https://openalex.org/W2935441635","https://openalex.org/W2994003192","https://openalex.org/W3135536219","https://openalex.org/W3173608822","https://openalex.org/W4200513010","https://openalex.org/W4380303824","https://openalex.org/W6771316629"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2027972911","https://openalex.org/W2146343568","https://openalex.org/W2013643406","https://openalex.org/W2157978810","https://openalex.org/W2111089054","https://openalex.org/W2912813468"],"abstract_inverted_index":{"Being":[0],"an":[1],"NP-hard":[2],"problem,":[3],"multicriteria":[4],"shortest":[5],"path":[6],"search":[7],"is":[8],"difficult":[9],"to":[10,53,69,72,76],"solve":[11],"with":[12],"speed":[13],"satisfactory":[14],"for":[15],"real-world":[16,73],"use.":[17],"Therefore,":[18],"this":[19],"article":[20],"examines":[21],"the":[22,35,38,41,45,58,65,77],"combination":[23],"of":[24,37,47,99],"t-discarding":[25],"kPC-MLS":[26,52,83],"[1]":[27],"and":[28],"multiple":[29],"pruning":[30],"heuristics.":[31,56],"Apart":[32],"from":[33],"comparing":[34],"efficiency":[36],"individual":[39],"techniques,":[40],"research":[42],"also":[43],"evaluates":[44],"ability":[46],"<tex":[48,79],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[49,80],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$t$</tex>":[50,81],"-discarding":[51,82],"employ":[54],"such":[55],"Since":[57],"experiments":[59],"were":[60],"conducted":[61],"on":[62,93],"country-size":[63],"roadmaps,":[64],"results":[66],"are":[67],"expected":[68],"be":[70],"relevant":[71],"applications.":[74],"According":[75],"measurements,":[78],"gains":[84],"a":[85,97],"higher":[86],"speedup":[87],"than":[88],"standard":[89],"MLS":[90],"[2],":[91],"operating":[92],"comparable":[94],"roadmaps":[95],"in":[96],"matter":[98],"seconds.":[100]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}